Professional Documents
Culture Documents
Chap 05 LP Models Graphical and Computer Methods Soan
Chap 05 LP Models Graphical and Computer Methods Soan
Steps in application:
Identify problem as solvable by linear programming.
Formulate a mathematical model of the unstructured
problem.
Solve the model.
Implementation
Requirements of LP Problems and
LP Basic Assumptions
Requirements
• Decision variables - mathematical symbols representing levels of activity of a firm.
• Objective function - a linear mathematical relationship describing an objective of the
firm, in terms of decision variables - this function is to be maximized or minimized.
• Constraints – requirements or restrictions placed on the firm by the operating
environment, stated in linear relationships of the decision variables.
• Parameters - numerical coefficients and constants used in the objective function and
constraints.
Assumptions
• Proportionality - The rate of change (slope) of the objective function and constraint
equations is constant.
• Additivity - Terms in the objective function and constraint equations must be additive.
• Divisibility -Decision variables can take on any fractional value and are therefore
continuous as opposed to integer in nature.
• Certainty - Values of all the model parameters are assumed to be known with certainty
(non-probabilistic).
• Non-negativity - all answers or variables are greater than or equal to (≥) zero
Pho Hu tieu
(40K VND/bowl) (50K VND/bowl)
Minime Restaurant
Chef Meat
(works 40 min./day) (120 grs meat/day)
Non-Negativity x1 0; x2 0
Constraints:
Feasible and Infeasible Solutions
A feasible solution does not violate any of the constraints:
Example x1 = 5 bowls of Pho
x2 = 10 bowls of Hu tieu
Z = 40x1 + 50x2 = 700 (K.VND)
Labor constraint check:
1(5) + 2(10) = 25 < 40 minutes, within constraint
Meat constraint check:
4(5) + 3(10) = 70 < 120 grams, within constraint
=E6-F6
=E7-F7
=C6*B10+D6*B11
=C7*B10+D7*B11
Objective function
Decision variables
C6*B10+D6*B11≤40
C7*B10+D7*B11≤120
Click on “Add” to
insert constraints
Using Excel’s Solver
to Solve LP Problems
Using QM for Windows and Excel
Solving Flair Furniture’s LP Problem
Nitrogen Phosphate
Brand
(lb/bag) (lb/bag)
Super-gro 2 4
Crop-quick 4 3
Fertilizing Farmer’s
Field
LP Model Formulation
A Minimization Example (2 of 6)
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)
LP Model Formulation and Constraint Graph
A Minimization Example (3 of 6)
– Infeasibility
– Unboundedness
– Redundancy
– Alternate Optimal Solutions
Four Special Cases in LP
• Infeasibility-A problem with no feasible solution
– Exists when there is no solution to the problem that satisfies
all the constraint equations
– No feasible solution region exists
X2
8–
–
6–
– Region Satisfying
4– Third Constraint
–
2–
–
0– | | | | | | | | | |
2 4 6 8 X1
Region Satisfying First Two Constraints
Four Special Cases in LP
• Unboundedness- A solution region unbounded to the right
– In a graphical solution, the feasible region will be open ended
– This usually means the problem has been formulated improperly
X2
X1 ≥ 5
15 –
X2 ≤ 10
10 –
Feasible Region
5–
X1 + 2X2 ≥ 15
| | | | |
0– 5 10 15 X1
Four Special Cases in LP
• Redundancy- A problem with a redundant constraint
– A redundant constraint is one that does not affect the feasible solution
region
X2
30 –
25 –
2X1 + X2 ≤ 30
20 –
Redundant
Constraint
15 –
X1 ≤ 25
10 – X1 + X2 ≤ 20
Feasible
5– Region
| | | | | |
0–
5 10 15 20 25 30 X1
Four Special Cases in LP
• Alternate optimal solutions
– Occasionally two or more optimal solutions may exist
X2 – Graphically this occurs when the objective function’s isoprofit or
isocost line runs perfectly parallel to one of the constraints
8–
7–
A
6– Optimal Solution Consists of All
Combinations of X1 and X2 Along
5– the AB Segment
4–
2–
B Isoprofit Line for $12
1 – Feasible Overlays Line Segment AB
Region
0– | | | | | | | |
1 2 3 4 5 6 7 8 X1
Sensitivity Analysis
s.t. x1 < 6
2x1 + 3x2 < 19
x1 + x2 < 8
x1, x2 > 0
Example: Sensitivity Analysis
• Graphical Solution
x2
8
x1 + x2 < 8
Max 5x1 + 7x2
7
6
x1 < 6
5
Optimal x1 = 5, x2 = 3
4
z = 46
3
2
2x1 + 3x2 < 19
1
1 2 3 4 5 6 7 8 9 10
x1
Example: Sensitivity Analysis
• Range of Optimality for c1
The slope of the objective function line is -c1/c2.
The slope of the 1st binding constraint, x1 + x2 = 8, is -1,
the slope of the 2nd binding constraint, 2x1 + 3x2 = 19, is -2/3.
Find the range of values for c1 (with c2 staying 7) such that
the objective function line slope lies between that of the two
binding constraints:
-1 < -c1/7 < -2/3
Constraint 2: Change the RHS value of the 2 nd constraint to 20 and resolve for the
optimal point determined by the last two constraints: 2x1 + 3x2 = 20 and x1 + x2 =
8.
The solution is x1 = 4, x2 = 4, z = 48.
Hence, the shadow price = znew - zold = 48 - 46 = 2.
Constraint 3: Change the RHS value of the 3 rd constraint to 9 and resolve for the
optimal point determined by the last two constraints: 2x1 + 3x2 = 19 and x1 + x2 =
9.
The solution is: x1 = 8, x2 = 1, z = 47.
Hence, the shadow price = znew - zold = 47 - 46 = 1.