268741_Class 3
268741_Class 3
Components:
SETS
Modeling
DATA
DATA:
Parameter = list of values;
ENDDATA
Values may be listed using space or commas to separate them
No. of values = No. of members in set associated with parameters
Example: Recall Student Set
Student/ John, Jill, Mike, Mary/ : CGA, age;
For set age = {20, 19, 18, 21}, we can write:
age = 20, 19, 18, 21; or age = 20 19 18 21;
© 2020 Department of Industrial Engineering, Chiang Mai University
Data (2) 10
The Wireless Widget (WW) Company has six warehouses supplying eight vendors with their
widgets. Each warehouse has a supply of widgets that cannot be exceeded, and each
vendor has a demand for widgets that must be satisfied. WW wants to determine how many
widgets to ship from each warehouse to each vendor so as to minimize the total shipping
cost. The following data are given:
Lingo Model:
Lingo Model:
Shadow Prices:
the shadow price for the i th constraint of an LP to be the amount by
which the optimal z-value is improved—increased in a max problem
and decreased in a min problem— if the right-hand side of the i th
constraint is increased by 1.
For Max Problem:
For Min Problem:
Solution Report:
Optimal Solution
Dual Prices (Shadow Prices)
Reduced Cost
Range Report:
Objective Function Coefficient Range
Right-hand Side Range
The range of values for an objective function coefficient for which the
current basis remains optimal.
Within this range, the value of the decision variables remain
unchanged but the optimal Z-value may or may not changed.
From Ex 1 Winco’s problem:
C1 : (4 - ∞) < C1 < (4+1) = -∞ < C1 < 5
C2 : (6 -0.5) < C2 < (6+0.666667) = 5.5 < C2 < 6.666667
C3 : (7 -0.5) < C3 < (7+1) = 6.5 < C3 < 8
C4 : (8 - ∞) < C4 < (8+2) = -∞ < C4 < 10
© 2020 Department of Industrial Engineering, Chiang Mai University
Example 3: 32
For any non-basic variable, the reduced cost for the variable is
the amount by which the non-basic variable’s objective
function coefficient must be improved before that variable will
become a basic variable in some optimal solution to the LP.
.
Variables
For any inequality constraint, the product of the values of the constraint’s slack or
excess variable and the constraint’s shadow price must equal 0. This implies that
any constraint whose slack or excess variable is > 0 will have a zero shadow price.
It also implies that any constraint with a nonzero shadow price must be binding
(have slack or excess equal to 0).
Level production
(50,000 + 120,000 + 150,000 + 80,000)
= 100,000 pounds
4
SALES PRODUCTION
QUARTER FORECAST PLAN INVENTORY
Spring 80,000 100,000 20,000
Summer 50,000 100,000 70,000
Fall 120,000 100,000 50,000
Winter 150,000 100,000 0
400,000 140,000
Cost of Level Production Strategy
(400,000 X $2.00) + (140,000 X $.50) = $870,000
Total Cost =
2nd Step: After got solution from the 1st step, adding
the solution of 1st to be the additional constraint and
solve the model again for the 2nd Goal.