BLP Linear Programming Summary

(replace this with model title)

LP Model

Maximize:
      PROFIT)
Subject to:
      SMHRS)
      MKTG)
      CLIMIT)
      DLIMIT)

15 B + 45 C + 30 D

B + 1.6 C + 2.5 D
B - C
C
D

<=
>=
<=
<=

240
20
50
40

Solution OPTIMAL in 4 iterations: MAX PROFIT = 4650

Decision Variable Summary

Variable	Opt Value	Unit PROFIT	Marg Value
1. B 2. C 3. D	160.000 50.000 -	15.000 45.000 30.000	- - -7.500

Constraint Summary

Constraint	REL	RHS	Slack/Surplus		Marg value
1. SMHRS 2. MKTG 3. CLIMIT 4. DLIMIT	<= >= <= <=	240.000 20.000 50.000 40.000	- 90.000 - 40.000	SRP SLK	15.000 - 21.000 -

Sensitivity of Profit Values

Variable	Current OF	Upper Limit (Becomes +)		Lower Limit (Becomes +)
1. B 2. C 3. D	15.000 45.000 30.000	28.125 +infinity 37.500	SLK:CLIMIT D	12.000 24.000 -infinity	D SLK:CLIMIT

Ranging the Right-Hand Side

Constraint	RHS	Upper Limit (Becomes 0)		Lower Limit (Becomes 0)
1. SMHRS 2. MKTG 3. CLIMIT 4. DLIMIT	240.00 20.00 50.00 40.00	+Infinity 110.00 84.62 +Infinity	SRP:MKTG SRP:MKTG	150.00 -Infinity 0.00 0.00	SRP:MKTG C SLK:DLIMIT

Back