Chapter6s Linear Programming
Chapter6s Linear Programming
Operations Management
William J. Stevenson
8th edition
6s-2 Linear Programming
CHAPTER
6s
Linear
Programming
Linear Programming
Labor
Machine time
6s-4 Linear Programming
Linear Programming
Objective - profit
Maximize Z=60X1 + 50X2
Subject to
Assembly 4X1 + 10X2 <= 100 hours
Inspection 2X1 + 1X2 <= 22 hours
Storage 3X1 + 3X2 <= 39 cubic feet
X1, X2 >= 0
6s-9 Linear Programming
Assembly Constraint
4X1 +10X2 = 100
12
10
Product X2
8
6
4
2
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Product X1
6s-10 Linear Programming
25
20
Product X2
15
10
5
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Product X1
6s-11 Linear Programming
25
Inspection
20
Product X2
15
Storage
Assembly
10
5
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Feasible solution space Product X1
6s-12 Linear Programming
25
20
Z=900
Product X2
15
10
0
0
10
12
14
16
18
20
22
24
Product X1
Z=300 Z=600
6s-13 Linear Programming
Constraints
Sensitivity Analysis