Systems Optimization

Systems Optimization
Linear Programming
Linear Programming
If an LP has more than two decision variables, the
range of values for a rhs (or objective function
coefficient) for which the basis remains optimal cannot
be determined graphically.
These ranges can be computed by hand but this is often

tedious, so they are usually determined by a packaged
computer program. MPL and LINDO will be used and
the interpretation of its sensitivity analysis discussed.
Note: sometimes Excel provides erroneous results
Linear Programming
c1 cost
Reduced
Dual or Shadow is the amount the
prices are the objective function
amount the coefficient for
optimal z-value variable i would
improves if the have to be
rhs of a increased for
Dual variables
constraint is there to be an
increased by one b2
alternative
unit (assuming optimal solution.
no change in
basis). More later
Linear Programming
Allowable ranges (w/o
c1 changing basis) for
the x1 coefficient
(c1) is:
0 c1 7.5
Allowable range (w/o

b2 changing basis) for
the rhs (b2) of the
second constraint is:
What about c2? And b1 and b3? 6 b2 18
Lindo Sensitivity Analysis
Allowable ranges in
terms of increase and
decrease
(w/o changing basis)
for the x1 coefficient
(c1) is:
0 c1 7.5
Linear Programming
Consider the following maximization problem. Winco sells
four types of products. The resources needed to produce one
unit of each are:
Product Product Product Produc Availabl
1 2 3 t4 e
Raw 2 3 4 7 4600
material
Hours of 3 4 5 6 5000
labor
Sales price $4 $6 $7 $8
To meet customer demand, exactly 950 total units must be
produced. Customers demand that at least 400 units of product 4
be produced. Formulate an LP to maximize profit.
Let xi = number of units of product i produced by Winco.
The Winco LP formulation:
max z = 4x1 + 6x2 +7x3 + 8x4

s.t. x1 + x2 + x3 + x4 = 950
x4 400
2x1 + 3x2 + 4x3 + 7x4 4600
3x1 + 4x2 + 5x3 + 6x4 5000
x1,x2,x3,x4 0
MAX 4 X1 + 6 X2 + 7 X3 + 8 X4
LINDO output and SUBJECT TO
sensitivity 2) X1 + X2 + X3 + X4 = 950
analysis 3) X4 >= 400
4) 2 X1 + 3 X2 + 4 X3 + 7 X4 <= 4600
example(s). 5) 3 X1 + 4 X2 + 5 X3 + 6 X4 <= 5000
END
Reduced cost LP OPTIMUM FOUND AT STEP 4
is the amount the OBJECTIVE FUNCTION VALUE
objective function 1) 6650.000
coefficient for VARIABLE VALUE REDUCED COST

variable i would X1
X2
0.000000
400.000000
1.000000
0.000000
have to be X3 150.000000 0.000000
X4 400.000000 0.000000
increased for
there to be an ROW
2)
SLACK OR SURPLUS
0.000000
DUAL PRICES
3.000000
alternative 3) 0.000000 -2.000000
4) 0.000000 1.000000
optimal solution. 5) 250.000000 0.000000
NO. ITERATIONS= 4
RANGES IN WHICH THE BASIS IS UNCHANGED:
LINDO sensitivity
OBJ COEFFICIENT RANGES
analysis example(s).
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
Allowable range (w/o
X1 4.000000 1.000000 INFINITY
changing basis) for
X2 6.000000 0.666667 0.500000
the x2 coefficient
X3 7.000000 1.000000 0.500000
(c2) is:
X4 8.000000 2.000000 INFINITY
5.50 c2 6.667
RIGHTHAND SIDE RANGES
Allowable range (w/o ROW CURRENT ALLOWABLE ALLOWABLE
changing basis) for RHS INCREASE DECREASE
the rhs (b1) of the first 2 950.000000 50.000000 100.000000
constraint is: 3 400.000000 37.500000 125.000000
4 4600.000000 250.000000 150.000000
850 b1 1000
5 5000.000000 INFINITY 250.000000
MAX 4 X1 + 6 X2 + 7 X3 + 8 X4
Shadow prices SUBJECT TO
2) X1 + X2 + X3 + X4 = 950
are shown in the 3) X4 >= 400
Dual Prices 4) 2 X1 + 3 X2 + 4 X3 + 7 X4 <= 4600
5) 3 X1 + 4 X2 + 5 X3 + 6 X4 <= 5000
section of END
LINDO output. LP OPTIMUM FOUND AT STEP 4
OBJECTIVE FUNCTION VALUE

Shadow prices 1) 6650.000
are the amount
VARIABLE VALUE REDUCED COST
the optimal z- X1 0.000000 1.000000
X2 400.000000 0.000000
value improves if X3 150.000000 0.000000
the rhs of a X4 400.000000 0.000000
constraint is ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 3.000000
increased by one 3) 0.000000 -2.000000
unit (assuming 4) 0.000000 1.000000
5) 250.000000 0.000000
no change in
NO. ITERATIONS= 4
basis).
Interpretation of shadow prices for the Winco LP
ROW SLACK OR SURPLUS DUAL PRICES

2) 0.000000 3.000000 (overall demand)
3) 0.000000 -2.000000 (product 4 demand)
4) 0.000000 1.000000 (raw material availability)
5) 250.000000 0.000000 (labor availability)
Assuming the allowable range of the rhs is not violated, shadow (Dual) prices
show: $3 for constraint 1 implies that each one-unit increase in total demand
will increase net sales by $3. The -$2 for constraint 2 implies that each unit
increase in the requirement for product 4 will decrease revenue by $2. The $1
shadow price for constraint 3 implies an additional unit of raw material (at no
cost) increases total revenue by $1. Finally, constraint 4 implies any additional
labor (at no cost) will not improve total revenue.
Shadow price signs
1. Constraints with symbols will always have
nonpositive shadow prices.
2. Constraints with will always have nonnegative
shadow prices.
3. Equality constraints may have a positive, a
negative, or a zero shadow price.
Managerial Use of Shadow Prices
The managerial MAX 4 X1 + 6 X2 + 7 X3 + 8 X4
SUBJECT TO
significance of shadow 2) X1 + X2 + X3 + X4 = 950 raw
prices is that they can 3) X4 >= 400
4) 2 X1 + 3 X2 + 4 X3 + 7 X4 <= 4600
material
often be used to 5) 3 X1 + 4 X2 + 5 X3 + 6 X4 <= 5000
determine the END
labor
maximum amount a LP OPTIMUM FOUND AT STEP 4
manager should be OBJECTIVE FUNCTION VALUE

willing to pay for an 1) 6650.000
additional unit of a VARIABLE VALUE REDUCED

resource. Reconsider COST
X1 0.000000 1.000000
the Winco to the right. X2 400.000000 0.000000
X3 150.000000 0.000000
X4 400.000000 0.000000
What is the most
Winco should be ROW
2)
SLACK OR SURPLUS
0.000000
DUAL PRICES
3.000000
willing to pay for 3) 0.000000 -2.000000
4) 0.000000 1.000000
additional units of raw 5) 250.000000 0.000000
material or labor?
NO. ITERATIONS= 4
Managerial Use of Shadow Prices
MAX 4 X1 + 6 X2 + 7 X3 + 8 X4
The shadow price for raw SUBJECT TO
material constraint (row 4) 2) X1 + X2 + X3 + X4 = 950
3) X4 >= 400
shows an extra unit of raw 4) 2 X1 + 3 X2 + 4 X3 + 7 X4 <= 4600
5) 3 X1 + 4 X2 + 5 X3 + 6 X4 <= 5000
material would increase END
revenue $1. Winco could
LP OPTIMUM FOUND AT STEP 4
pay up to $1 for an extra
OBJECTIVE FUNCTION VALUE
unit of raw material and be 1) 6650.000
as well off as it is now.
VARIABLE VALUE REDUCED
COST
Labor constraints (row 5) X1 0.000000 1.000000
shadow price is 0 meaning X2
X3
400.000000
150.000000
0.000000
0.000000
that an extra hour of labor X4 400.000000 0.000000
will not increase revenue. ROW SLACK OR SURPLUS DUAL PRICES

So, Winco should not be 2)
3)
0.000000
0.000000
3.000000
-2.000000
willing to pay anything for 4) 0.000000 1.000000
5) 250.000000 0.000000
an extra hour of labor.
NO. ITERATIONS= 4

Systems Optimization

Uploaded by

Copyright:

Available Formats

Systems Optimization

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Systems Optimization

Uploaded by

Copyright:

Available Formats

Systems Optimization

These ranges can be computed by hand but this is often

Allowable range (w/o

max z = 4x1 + 6x2 +7x3 + 8x4

coefficient for VARIABLE VALUE REDUCED COST

OBJECTIVE FUNCTION VALUE

constraint is ROW SLACK OR SURPLUS DUAL PRICES

ROW SLACK OR SURPLUS DUAL PRICES

manager should be OBJECTIVE FUNCTION VALUE

additional unit of a VARIABLE VALUE REDUCED

will not increase revenue. ROW SLACK OR SURPLUS DUAL PRICES

You might also like