Chapter 7 - Linear Programming Model
Chapter 7 - Linear Programming Model
7-1
Learning Objectives
Students will be able to:
Understand the basic assumptions and properties of linear programming (LP). Formulate small to moderatesized LP problems. Graphically solve any LP problem with two variables by both the corner point and isoline methods.
7-2
7-3
Chapter Outline
7.1 Introduction 7.2 Requirements of a Linear Programming Problem 7.3 Formulating LP Problems 7.4 Graphical Solution to an LP
Problem
7.5 Solving Flair Furnitures LP Problem using QM for Windows
and Excel
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
7-4
7-5
7-6
cost
5. Determination of a distribution system that will minimize total shipping cost from several warehouses to various market locations
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
7-7
7-8
Proportionality
Additivity Divisibility Nonnegativity
7-9
4 2 $7
3 1 $5
7-10
Number of Chairs
Painting/Varnishing
80 60 40
Carpentry
20 0
20
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
40
7-11
60
80
100
Number of Tables
2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458
120
Number of Chairs
Painting/Varnishing
100 80 60
Carpentry
40 20 0 20 40
7-12
Feasible Region
60 80 100
Number of Tables
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458
Number of Chairs
80 60 40 20 0
Carpentry
20
40
60
80
100
Number of Tables
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
7-13
Isoprofit Lines
Painting/Varnishing
Number of Chairs
80 60 40
20
0 20
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
40
60
7-14
80
100
Number of Tables
2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458
2
100
Corner Points
Painting/Varnishing
Number of Chairs
80 60 40
20
1
0 20
4 60 80 Number of Tables
40
7-15
100
7-16
7-17
4 X1 + 3 X 2 48
X1
11/2 (C)
7-18
7-19
7-20
Special Cases in LP
Infeasibility
Unbounded Solutions Redundancy Degeneracy More Than One Optimal Solution
7-21
8
6 4
2
0
X1
7-22
X1 > 5
X2 < 10
10
Feasible Region
X1 + 2X2 > 10
10
15
X1
7-23
2X1 + X2 < 30
20
15 10 5 0
Redundant Constraint
X1 < 25
X1 + X2 < 20
Feasible Region
X1
10
15
7-24
20
25
30
8 7 6 5 4 3 2 1 A
Optimal Solution Consists of All Combinations of X1 and X2 Along the AB Segment Isoprofit Line for $8
B AB
0
1 2 3 4
7-25
Sensitivity Analysis
Changes in the Objective
Function Coefficient
Coefficients
7-26
CD Players
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna
CD Players
7-27
2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458
Optimal Solution
X1
20
40
X1
CD Players
7-28
2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458