Professional Documents
Culture Documents
Taylor Introms10 PPT Ch-02
Taylor Introms10 PPT Ch-02
Chapter 2
Model Formulation
A Maximization Model Example
Graphical Solutions of Linear Programming Models
A Minimization Model Example
Irregular Types of Linear Programming Models
Characteristics of Linear Programming Problems
Bowl 1 4 40
Mug 2 3 50
Non-Negativity x1 0; x2 0
Constraints:
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice
Hall 2-8
LP Model Formulation
A Maximization Example (4 of 4)
Example: x1 = 5 bowls
x2 = 10 mugs
Z = $40x1 + $50x2 = $700
Example: x1 = 10 bowls
x2 = 20 mugs
Z = $40x1 + $50x2 = $1400
X2 is mugs
X1 is bowls
Figure 2.2 Coordinates for Graphical
Analysis
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-13
Labor Constraint
Graphical Solution of Maximization Model (2 of
12)
Nitrogen Phosphate
Brand
(lb/ bag) (lb/ bag)
Super-gro 2 4
Crop-quick 4 3
Decision Variables:
x1 = bags of Super-gro
x2 = bags of Crop-quick
Model Constraints:
2x1 + 4x2 16 lb (nitrogen constraint)
4x1 + 3x2 24 lb (phosphate constraint)
x1, x2 0 (non-negativity constraint)
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-29
Constraint Graph – Minimization (4 of 8)
Step 3:
Establish Model Constraints
x1 + x2 = 1,000 lb
x1 500 lb of chicken
x2 200 lb of beef
x1/x2 2/1 or x1 - 2x2 0
x1, x2 0
The Model: Minimize Z = $3x1 + 5x2
subject to: x1 + x2 = 1,000 lb
x1 500
x2 200
x1 - 2x2 0
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-43
Example Problem No. 2 (1 of 3)