Professional Documents
Culture Documents
Linear Programming - Graphical Method
Linear Programming - Graphical Method
Bishram
Chapter Topics
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
1
LP Model Formulation
A Maximization Example (1 of 4)
Bowl 1 4 40
Mug 2 3 50
LP Model Formulation
A Maximization Example (2 of 4)
2
Linear Programming: An Overview
Model Components
3
Summary of Model Formulation Steps
LP Model Formulation
A Maximization Example (3 of 4)
Resource 40 hrs of labor per day
Availability: 120 lbs of clay
Decision x1 = number of bowls to produce per day
Variables: x2 = number of mugs to produce per day
Objective Maximize Z = $40x1 + $50x2
Function: Where Z = profit per day
Resource 1x1 + 2x2 40 hours of labor
Constraints: 4x1 + 3x2 120 pounds of clay
Non-Negativity x1 0; x2 0
Constraints:
4
LP Model Formulation
A Maximization Example (4 of 4)
Feasible Solutions
Example: x1 = 5 bowls
x2 = 10 mugs
Z = $40x1 + $50x2 = $700
10
5
Infeasible Solutions
Example: x1 = 10 bowls
x2 = 20 mugs
Z = $40x1 + $50x2 = $1400
11
12
6
Coordinate Axes
Graphical Solution of Maximization Model (1 of 12)
X2 is mugs
X1 is bowls
Figure 2.2 Coordinates for Graphical
Analysis
13
Both Constraints
Graphical Solution of Maximization Model (5 of 12)
14
7
Feasible Solution Area
Graphical Solution of Maximization Model (6 of 12)
Z= 40x1 + 30x2
15
16
8
Alternative Objective Function Solution Lines
Graphical Solution of Maximization Model (8 of 12)
17
Optimal Solution
Graphical Solution of Maximization Model (9 of 12)
18
9
Optimal Solution Coordinates
Graphical Solution of Maximization Model (10 of 12)
20
10
Optimal Solution for New Objective Function
Graphical Solution of Maximization Model (12 of 12)
Slack Variables
22
11
Linear Programming Model: Standard Form
Nitrogen Phosphate
Brand
(lb/bag) (lb/bag)
Super-gro 2 4
Crop-quick 4 3
24
12
LP Model Formulation – Minimization (2 of 8)
25
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)
26
13
Constraint Graph – Minimization (4 of 8)
27
28
14
Optimal Solution Point – Minimization (6 of 8)
29
30
15
Graphical Solutions – Minimization (8 of 8)
31
32
16
Multiple Optimal Solutions Beaver Creek Pottery
33
An Infeasible Problem
34
17
An Unbounded Problem
35
36
18
Properties of Linear Programming Models
37
Problem Statement
Example Problem No. 1 (1 of 3)
38
19
Solution
Example Problem No. 1 (2 of 3)
Step 1:
Identify decision variables.
x1 = lb of chicken in mixture
x2 = lb of meat in mixture
Step 2:
Formulate the objective function.
Minimize Z = $3x1 + $5x2
where Z = cost per 1,000-lb batch
$3x1 = cost of chicken
$5x2 = cost of meat
39
Solution
Example Problem No. 1 (3 of 3)
Step 3:
Establish Model Constraints
x1 + x2 = 1,000 lb
x1 500 lb of chicken X1 >= 1000
x2 200 lb of meat
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 + x2 = 1000
x1 500 X1 – 2x2 >=0
x2 200
x1 - 2x2 0 X2 >= 200
x1,x2 0
40
20
Another Problem- Formulate
A local business firm is planning to advertise a
special sale on radio and television during a
particular week. A maximum budget of Rs. 16,000 is
approved for this purpose. It is found that radio
commercials cost Rs. 800 per 30 second spot with
minimum contract of 5 spots. A television
commercial, on the other hand, costs Rs. 4,000 per
spot. Because of heavy demand, only 4 television
spots are still available in the week. Also, it is
believed that a TV spot is 6-times as effective as a
radio spot in reaching consumers. How should the
firm allocate its advertising budget to attract the
largest number of consumers?
41
Formulation
Decision Variable:
Let X1 be the number of advertisement spots booked for Radio
Let X2 be the number of advertisement spots booked for TV
Objective Function
Max Z = x1 +6x2
Constraints
Equation of Constraints:
BUDGET 800X1 + 4000X2 <=16000
Radio spots X1 >= 5
Tv Spots X2 <=4
Non-Negative Constraints: X1, X2 >=0
LINGO Syntax
Max x1 +6x2
ST
800X1 + 4000X2 <=16000
X1 >= 5
X2 <=4
End
42
21
Example: A new Problem
43
44
22
Example Problem No. 2 (3 of 3)
45
Thank You
46
23