Professional Documents
Culture Documents
HR Om11 Modb
HR Om11 Modb
MODULE
PowerPoint presentation to accompany
Heizer and Render
Operations Management, Eleventh Edition
Principles of Operations Management, Ninth Edition
© 2014
© 2014
Pearson
Pearson
Education,
Education,
Inc.Inc. MB - 1
Outline
► Why Use Linear Programming?
► Requirements of a Linear
Programming Problem
► Formulating Linear Programming
Problems
► Graphical Solution to a Linear
Programming Problem
Decision Variables:
X1 = number of x-pods to be produced
X2 = number of BlueBerrys to be produced
Second Constraint:
Assembly Assembly
time used is ≤ time available
2X1 + 1X2 ≤ 100 (hours of assembly time)
© 2014 Pearson Education, Inc. MB - 15
Graphical Solution
▶ Can be used when there are two decision
variables
1. Plot the constraint equations at their limits by
converting each equation to an equality
2. Identify the feasible solution space
3. Create an iso-profit line based on the
objective function
4. Move this line outwards until the optimal
point is identified
100 –
–
Number of BlueBerrys
80 – Assembly (Constraint B)
–
60 –
–
40 –
– Electronic (Constraint A)
Feasible
20 –
region
–
| |
– | | | | | | | | |
X1
0 20 40 60 80 100
Figure B.3 Number of x-pods
© 2014 Pearson Education, Inc. MB - 17
Graphical Solution
X
Iso-Profit Line Solution Method
2
100 –
Choose a possible
– value for the objective
function 80 –
Number of BlueBerrys
Assembly (Constraint B)
–
60 –
$210 = 7X1 + 5X2
–
Solve for the
40 –axis intercepts of the function and
plot the line – Electronic (Constraint A)
Feasible
20 –
X =
region
– 2 42 X1 = 30
| |– | | | | | | | | | X1
0 20 40 60 80 100
Figure B.3 Number of x-pods
© 2014 Pearson Education, Inc. MB - 18
Graphical Solution
X2
100 –
–
Number of BlueBerrys
80 –
–
60 – $210 = $7X1 + $5X2
–
(0, 42)
40 –
–
20 – (30, 0)
–
|
–| | | | | | | | | |
X1
0 20 40 60 80 100
Figure B.4 Number of x-pods
© 2014 Pearson Education, Inc. MB - 19
Graphical Solution
X2
100 –
– $350 = $7X1 + $5X2
Number of BlueBerrys
80 –
$280 = $7X1 + $5X2
–
60 – $210 = $7X1 + $5X2
–
40 –
– $420 = $7X1 + $5X2
20 –
–
| –| | | | | | | | | |
X1
0 20 40 60 80 100
Figure B.5 Number of x-pods
© 2014 Pearson Education, Inc. MB - 20
Graphical Solution
X2
100 –
– Maximum profit line
Number of BlueBerrys
80 –
–
60 – Optimal solution point
– (X1 = 30, X2 = 40)
40 –
– $410 = $7X1 + $5X2
20 –
–
| | | | | | | | | | |
– X1
0 20 40 60 80 100
Figure B.6 Number of x-pods
© 2014 Pearson Education, Inc. MB - 21
Corner-Point Method
X2
100 –
2 –
Number of BlueBerrys
80 –
–
60 –
–
3
40 –
–
20 –
–
1
| |
– | | | | | | | | |
X1
0 20 40 60 80 100
4
Figure B.7 Number of x-pods
© 2014 Pearson Education, Inc. MB - 22
Corner-Point Method
X2
► The optimal value will always be at a corner
point 100 –
2 –
► Find the objective function value at each
Number of BlueBerrys
80 –
corner point– and choose the one with the
highest profit
60 –
–
3
40 –
Point 1 : (X1 = 0, X2 = 0) Profit $7(0) + $5(0) = $0
–
Point 2 : (X1 20
= 0,– X2 = 80) Profit $7(0) + $5(80) = $400
–
Point 4 : (X1| = 50, X| 2 =| 0) | Profit $7(50) + $5(0) = $350
1
|
– | | | | | |
X1
0 20 40 60 80 100
4
Figure B.7 Number of x-pods
© 2014
© 2014
Pearson
Pearson
Education,
Education,
Inc.Inc. MB - 23
Corner-Point Method
X2
► The optimal value will always be at a corner
Solve 100
point for –the intersection of two constraints
2 –
► Find the objective
4X + 3X2 ≤function value time)
240 (electronic at each
Number of BlueBerrys
80 1–
corner point
2X1 –+and
1X2 choose the onetime)
≤ 100 (assembly with the
highest profit
60 –
4X1 + 3X
– 2 = 240 4X1 + 3(40) = 240
3
40 –
Point 1 : – 4X
(X11 =– 0,
2XX22 == 0)–200 4X$7(0)
Profit 1 + +120
$5(0)==240
$0
–
Point 2 : (X1 20
=+ 0,
1X = 80) 40
– X22 = X1 = = 30
Profit $7(0) + $5(80) $400
–
Point 4 : (X1| = 50, X| 2 =| 0) | Profit $7(50) + $5(0) = $350
1
|
– | | | | | |
X1
0 20 40 60 80 100
4
Figure B.7 Number of x-pods
© 2014
© 2014
Pearson
Pearson
Education,
Education,
Inc.Inc. MB - 24
Corner-Point Method
X2
► The optimal value will always be at a corner
point 100 –
2 –
► Find the objective function value at each
Number of BlueBerrys
80 –
corner point– and choose the one with the
highest profit
60 –
–
3
40 –
Point 1 : (X1 = 0, X2 = 0) Profit $7(0) + $5(0) = $0
–
Point 2 : (X1 20
= 0,– X2 = 80) Profit $7(0) + $5(80) = $400
–
Point 4 : (X1| = 50, X| 2 =| 0) | | Profit $7(50) + $5(0) = $350
1
|
– | | | | |
X1
Point 3 : (X10= 30, 20
X2 = 40) 40
4
60Profit 80
$7(30)100
+ $5(40) = $410
Figure B.7 Number of x-pods
© 2014
© 2014
Pearson
Pearson
Education,
Education,
Inc.Inc. MB - 25
Sensitivity Analysis
▶ How sensitive the results are to
parameter changes
▶ Change in the value of coefficients
▶ Change in a right-hand-side value of a
constraint
▶ Trial-and-error approach
▶ Analytic postoptimality method
50 –
Feasible
region
40 –
30 – b
20 –
a
X1 = 30
10 – X2 = 20
| | | | | | |
– X1
0 10 20 30 40 50 60
© 2014 Pearson Education, Inc. MB - 35
Minimization Example
FEED
INGREDIENT STOCK X STOCK Y STOCK Z
A 3 oz 2 oz 4 oz
B 2 oz 3 oz 1 oz
C 1 oz 0 oz 2 oz
D 6 oz 8 oz 4 oz
F = Full-time tellers
P1 = Part-time tellers starting at 9 AM (leaving at 1 PM)
P2 = Part-time tellers starting at 10 AM (leaving at 2 PM)
P3 = Part-time tellers starting at 11 AM (leaving at 3 PM)
P4 = Part-time tellers starting at noon (leaving at 4 PM)
P5 = Part-time tellers starting at 1 PM (leaving at 5 PM)
© 2014 Pearson Education, Inc. MB - 41
LP Applications
Minimize total daily
manpower cost = $75F + $24(P1 + P2 + P3 + P4 + P5)
F + P1 ≥ 10 (9 AM - 10 AM needs)
F + P1 + P2 ≥ 12 (10 AM - 11 AM needs)
1/2 F + P1 + P2 + P3 ≥ 14 (11 AM - 11 AM needs)
1/2 F + P1 + P2 + P3 + P4 ≥ 16 (noon - 1 PM needs)
F + P2 + P3 + P4 + P5 ≥ 18 (1 PM - 2 PM needs)
F + P3 + P4 + P5 ≥ 17 (2 PM - 3 PM needs)
F + P4 + P5 ≥ 15 (3 PM - 7 PM needs)
F + P5 ≥ 10 (4 PM - 5 PM needs)
F ≤ 12
4(P1 + P2 + P3 + P4 + P5) ≤ .50(10 + 12 + 14 + 16 + 18 + 17 + 15 + 10)
F + P1 ≥ 10 (9 AM - 10 AM needs)
F + P1 + P2 ≥ 12 (10 AM - 11 AM needs)
1/2 F + P1 + P2 + P3 ≥ 14 (11 AM - 11 AM needs)
1/2 F + P1 + P2 + P3 + P4 ≥ 16 (noon - 1 PM needs)
F + P2 + P3 + P4 + P5 ≥ 18 (1 PM - 2 PM needs)
F + P3 + P4 + P5 ≥ 17 (2 PM - 3 PM needs)
F + P4 + P5 ≥ 15 (3 PM - 7 PM needs)
F + P5 ≥ 10 (4 PM - 5 PM needs)
F ≤ 12
4(P1 + P2 + P3 + P4 + P5) ≤ .50(112)
F, P1, P2, P3, P4, P5 ≥ 0