Scribd
Upload
101 views

Management Science3 Part 2

This document discusses solving a linear programming problem graphically in 12 steps: 1) Define the decision variables and objective function 2) Graph the constraints to identify the feasible region 3) Draw the objective function line and find its highest point of intersection with the feasible region, which is the optimal solution 4) The optimal solution can also be found at a corner point of the feasible region. Changing the objective function results in a different optimal solution.

Uploaded by

Gela Soriano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
101 views

Management Science3 Part 2

This document discusses solving a linear programming problem graphically in 12 steps: 1) Define the decision variables and objective function 2) Graph the constraints to identify the feasible region 3) Draw the objective function line and find its highest point of intersection with the feasible region, which is the optimal solution 4) The optimal solution can also be found at a corner point of the feasible region. Changing the objective function results in a different optimal solution.

Uploaded by

Gela Soriano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

Linear Programming:

Model Formulation and


Graphical Solution

2-1
Problem Statement
Example Problem No. 1 (1 of 3)

■ Hot dog mixture in 1000-pound batches.


■ Two ingredients, chicken ($3/lb) and beef ($5/lb).
■ Recipe requirements:
at least 500 pounds of “chicken”
at least 200 pounds of “beef”
■ Ratio of chicken to beef must be at least 2 to 1.
■ Determine optimal mixture of ingredients that will
minimize costs.

2-2
Solution
Example Problem No. 1 (2 of 3)
Step 1:
Identify decision variables.
x1 = lb of chicken in mixture
x2 = lb of beef 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 beef
2-3
Solution
Example Problem No. 1 (3 of 3)

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
2-4
Graphical Solution of LP Models

 Graphical solution is limited to linear programming models


containing only two decision variables (can be used with three
variables but only with great difficulty).

 Graphical methods provide visualization of how a solution for


a linear programming problem is obtained.

 Graphical method of linear programming is used to solve


problems by finding the highest or lowest point of intersection
between the objective function line and the feasible region on
a graph.

2-5
Coordinate Axes
Graphical Solution of Maximization Model (1 of
12)

X2 is mugs

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

X1 is bowls
Figure 2.2 Coordinates for Graphical
Analysis 2-6
Labor Constraint
Graphical Solution of Maximization Model (2 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.3 Graph of Labor Constraint


2-7
Labor Constraint Area
Graphical Solution of Maximization Model (3 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.4 Labor Constraint Area


2-8
Clay Constraint Area
Graphical Solution of Maximization Model (4 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.5 Clay Constraint Area


2-9
Both Constraints
Graphical Solution of Maximization Model (5 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.6 Graph of Both Model Constraints


2-10
Feasible Solution Area
Graphical Solution of Maximization Model (6 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.7 Feasible Solution Area


2-11
Objective Function Solution = $800
Graphical Solution of Maximization Model (7 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.8 Objection Function Line for Z =


$800 2-12
Alternative Objective Function Solution Lines
Graphical Solution of Maximization Model (8 of 12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.9 Alternative Objective Function Lines


2-13
Optimal Solution
Graphical Solution of Maximization Model (9 of
12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.10 Identification of Optimal Solution Point


2-14
Optimal Solution Coordinates
Graphical Solution of Maximization Model (10 of 12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.11 Optimal Solution Coordinates


2-15
Extreme (Corner) Point Solutions
Graphical Solution of Maximization Model (11 of 12)

Maximize Z = $40x1 + $50x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.12 Solutions at All Corner


Points 2-16
Optimal Solution for New Objective Function
Graphical Solution of Maximization Model (12 of 12)

Maximize Z = $70x1 + $20x2


subject to: 1x1 + 2x2  40
4x2 + 3x2  120
x1, x2  0

Figure 2.13 Optimal Solution with Z = 70x1 + 20x2


2-17

You might also like