Professional Documents
Culture Documents
Qntmeth9 PPT ch07
Qntmeth9 PPT ch07
Linear
Programming
Models: Graphical
and Computer
Methods
Prepared by Lee Revere and John Large
• Carpentry 4 3 240
• Painting 2 1 100
&Varnishing
Mathematical formulation:
Profit Amount $7 $5
100
2T + 1C ≤ 100
Painting/Varnishing
Number of Chairs
80
60
40 4T + 3C ≤ 240
Carpentry
20
0
20 40 60 80 100
Number of Tables
To accompany Quantitative Analysis 7-15 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture Company
Feasible Region
120
Painting/Varnishing
Number of Chairs
100
80
60
Carpentry
40
Feasible
20 Region
0
20 40 60 80 100
Number of Tables
To accompany Quantitative Analysis 7-16 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Isoprofit Lines Steps
1. Graph all constraints and find the
feasible region.
2. Select a specific profit (or cost) line
and graph it to find the slope.
3. Move the objective function line in
the direction of increasing profit (or
decreasing cost) while maintaining
the slope. The last point it touches in
the feasible region is the optimal
solution.
4. Find the values of the decision
variables at this last point and compute
the profit (or cost).
Isoprofit Lines
Isoprofit Line Solution Method
Start by letting profits equal some
arbitrary but small dollar amount.
Choose a profit of, say, $210.
- This is a profit level that can be
obtained easily without violating
either of the two constraints.
The objective function can be written as
$210 = 7T + 5C.
Isoprofit Lines
Isoprofit Line Solution Method
• The objective function is just the
equation of a line called an isoprofit line.
- It represents all combinations of (T, C) that
would yield a total profit of $210.
To plot the profit line, proceed exactly as
done to plot a constraint line:
- First, let T = 0 and solve for the point at
which the line crosses the C axis.
- Then, let C = 0 and solve for T.
$210 = $7(0) + $5(C)
C = 42 chairs
Then, let C = 0 and solve for T.
$210 = $7(T) + $5(0)
T = 30 tables
To accompany Quantitative Analysis 7-19 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture Company
Isoprofit Lines
Isoprofit Line Solution Method
Next connect these two points with a
straight line. This profit line is illustrated
in the next slide.
All points on the line represent feasible
solutions that produce an approximate
profit of $210
Obviously, the isoprofit line for $210
does not produce the highest possible
profit to the firm.
Try graphing more lines, each yielding a
higher profit.
Another equation, $420 = $7T + $5C, is
plotted in the same fashion as the lower
line.
Isoprofit Lines
Isoprofit Line Solution Method
When T = 0,
$420 = $7(0) + 5(C)
C = 84 chairs
When C = 0,
$420 = $7(T) + 5(0)
T = 60 tables
This line is too high to be considered as
it no longer touches the feasible region.
The highest possible isoprofit line is
illustrated in the second following slide.
It touches the tip of the feasible region at
the corner point (T = 30, C = 40) and
yields a profit of $410.
To accompany Quantitative Analysis 7-21 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture Company
Isoprofit Lines
120
100
Painting/Varnishing
Number of Chairs
80 7T + 5C = 210
60 7T + 5C = 420
40 Carpentry
20
0
20 40 60 80 100
Number of Tables
To accompany Quantitative Analysis 7-22 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture Company
Optimal Solution
120
Isoprofit Lines
100
Painting/Varnishing
Number of Chairs
80
Solution
60
(T = 30, C = 40)
40 Carpentry
20
0
20 40 60 80 100
Number of Tables
To accompany Quantitative Analysis 7-23 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture Company
Corner Point
Corner Point Solution Method
A second approach to solving LP
problems
It involves looking at the profit at
every corner point of the feasible
region
The mathematical theory behind LP is
that the optimal solution must lie at
one of the corner points in the feasible
region
Corner Point
Corner Point Solution Method
The feasible region for the Flair Furniture
Company problem is a four-sided polygon
with four corner, or extreme, points.
These points are labeled 1 ,2 ,3 , and 4 on
the next graph.
To find the (T, C) values producing the
maximum profit, find the coordinates of
each corner point and test their profit levels.
80
Solution
60
(T = 30, C = 40)
40 Carpentry
3
20
1
0
20 4 60
40 80 100
Number of Tables
To accompany Quantitative Analysis 7-27 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Flair Furniture - QM
for Windows
To use QM for Windows,
1. Select the Linear Programming module.
2. Then specify
- the number of constraints (other than the
non-negativity constraints, as it is assumed
that the variables must be nonnegative),
- the number of variables, and
- whether the objective is to be maximized or
minimized.
For the Flair Furniture Company problem, there
are
two constraints and two variables.
Subject to:
5X1 + 10X2 90 oz. (A)
4X1 + 3X2 48 oz. (B)
½ X1 1 ½ oz. (C)
X1, X2 0 (D)
where,
X 1 = # of pounds of brand 1 feed purchased
X 2 = # of pounds of brand 2 feed purchased
(A) = ingredient A constraint
(B) = ingredient B constraint
(C) = ingredient C constraint
(D) = non-negativity constraints
To accompany Quantitative Analysis 7-41 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
Holiday Meal Turkey
Ranch
Using the Corner Point Method
To solve this problem:
1. Construct the feasible solution region.
This is done by plotting each of the three
constraint equations.
2. Find the corner points.
This problem has 3 corner points, labeled
a, b, and c.
2. Unbounded Solutions:
- when the objective function in a maximization
problem can be infinitely large, the problem is
unbounded and is missing one or more constraints.
3. Redundancy:
- a redundant constraint is one that does not affect the
feasible solution region.
6
Region Satisfying
4
3rd Constraint
2
2 4 6 8 X1
15 X1 > 5
X2 < 10
10
Feasible Region
5
X1 + 2X2 > 10
0
5 10 15 X1
30
10
X1 + X2 < 20
5
0 Feasible
Region
X1
5 10 15 20 25 30
To accompany Quantitative Analysis 7-50 © 2006 by Prentice Hall, Inc.
for Management, 9e Upper Saddle River, NJ 07458
by Render/Stair/Hanna
An Example of Alternate
Optimal Solutions
8
Optimal Solution Consists of
7
All Combinations of X1 and
6 X2 Along the AB Segment
5 A Isoprofit Line for $8
4
Isoprofit Line
3
B for $12
2 Overlays Line
AB
1 Segment
0
1 2 3 4 5 6 7 8