Linear Programming
Operations Management
William J. Stevenson
8th edition
6s-2
Linear Programming
CHAPTER
6s
Linear
Programming
McGraw-Hill/Irwin
6s-3
Linear Programming
Linear Programming
6s-4
Linear Programming
Linear Programming
6s-5
Linear Programming
6s-6
Linear Programming
6s-7
Linear Programming
2.
3.
4.
5.
6s-8
Linear Programming
Objective - profit
Maximize Z=60X1 + 50X2
Subject to
Assembly
Inspection
Linear Programming
Product X2
6s-9
12
10
8
6
4
2
0
Product X1
Product X2
25
20
15
10
5
0
Product X1
Product X2
25
20
15
Inspection
Storage
10
Assembly
5
0
Product X1
Product X2
25
20
Z=900
15
10
5
0
Z=300
Z=600
Product X1
Solution
The intersection of inspection and storage
Solve two equations in two unknowns
2X1 + 1X2 = 22
3X1 + 3X2 = 39
X1 = 9
X2 = 4
Z = $740
Constraints
Simplex Method
Simplex:
a linear-programming algorithm
that can solve problems having more than
two decision variables
Sensitivity Analysis
CHAPTER
White Lightning
2
3
1
3
12
10
Rotgut
1
2
1
2
8
20
=C60*$C$52+D60*$D$52
=C61*$C$52+D61*$D$52
=C62*$C$52+D62*$D$52
=C63*$C$52+D63*$D$52
=C65*C64+D65*D64
<=
<=
<=
<=
40
70
50
72
Profit
40
70
30
70
<=
<=
<=
<=
$280.00 Profit
The top view shows formulas and the bottom view shows initial
calculations.
40
70
50
72
Hours
70
$E$50<=$F$50
Not Binding
2
A binding constraint is one
that limits the value our
objective function can
assume. We use up all of
our corn and sugar (we have
no slack).
Name
Corn
Sugar
Jugs
Hours
Final
Value
40
70
30
70
Shadow
Price
4
-
Constraint
R.H. Side
40
70
50
72
Allowable
Increase
6.67
2
1E+30
1E+30
Allowable
Decrease
5
10
20
2