CH 2-1 Linear PP Introduction and Graphic Method
CH 2-1 Linear PP Introduction and Graphic Method
CH 2-1 Linear PP Introduction and Graphic Method
Linear Programming
Formulations-Application and Model
2.1. Introduction to Linear Programming
Profit from the Sale of table is Birr 40 and that of a chair is Birr 30.
Required: formulate the LP Problem (LPP)?
Solution:
Step I Identification of the decision variables. Let x1 = Number of tables produced and X2 = Number of Chairs produced
Step II List down all the constraints.
Total time on machine M1 cannot exceed 200 hour
a.
7x1+4x2 ≤ 200
(Since it takes 7 hours to produce a table & 4 hours to produce a chair on machine M1)
b. Total time on machine M2 cannot exceed 400 hour
5x1+5x2 ≤ 400 (Since it takes 5 hours to produce both a table & a chair on machine M2)
Step III. The objective function for maximizing the profit is
given by
Maximize
(Since profit per unit from a table and a chair is Birr 40 & Birr.
30 respectively).
Presenting the problem as LPP, the given problem can now
be formulated as a linear programming model as follows:
Maximize Z =40x1+30x2
Subject to: 7x1+4x2≤ 200
5x1+5x2 ≤ 400
Further; x 1 & x2 ≥ 0
(Since if x1 & x2 < 0 it means that negative quantities of
products are being manufactured which has no meaning).
Example 2
Alpha Limited produces & sells 2 different products
under the brand name black & white. The profit per unit
on these products is Birr 50 & Birr 40 respectively. Both
black & white employ the same manufacturing process
which has a fixed total capacity of 50,000 man-hours.
As per the estimates of the marketing research
department of Alpha Limited, there is a market demand
for maximum 8,000 units of Black & 10,000 units of
white. Subject to the overall demand, the products can
be sold in any possible combination. If it takes 3 hours
to produce one unit of black & 2 hours to produce one
unit of white. Formulate the about as a linear
programming model?
2.4. Method for solving LPP
2.4.1. GRAPHICAL LINEAR PROGRAMMING
METHODS
Example 2
Maximize Z = $40 x1 + 50 x2
Subject to
x1 + 2x2 40 hr (labor constraint)
4x1 + 3x2 120 lb(clay constraint)
x1 , x20
Graphical Solution: Example
x2
50 –
40 –
4 x1 + 3 x2 120 lb
30 –
Area common to
20 –
both constraints
10 – x1 + 2 x2 40 hr
| | | | | |
0–
10 20 30 40 50 60 x1
Computing Optimal Values
x2 x1 + 2x2 = 40
40 –
4x1 + 3x2 = 120
4 x1 + 3 x2 120 lb
30 – 4x1 + 8x2 = 160
-4x1 - 3x2 = -120
20 –
5x2 = 40
10 – x1 + 2 x2 40 hr
x2 = 8
0 –8
| | 24 | | x1 x1 + 2(8) = 40
10 20 30 40
x1 = 24
Z = $40(24) + $50(8) = $1,360
Extreme Corner Points
x1 = 0 bowls
x2 x2 =20 mugs
x1 = 24 bowls
Z = $1,000
x2 =8 mugs
40 –
x1 = 30 bowls
Z = $1,360
30 – x2 =0 mugs
20 – A Z = $1,200
10 – B
| | | C|
0–
10 20 30 40 x1
Objective Function
x2
40 – 4x1 + 3x2 120 lb
Z = 70x1 + 20x2
30 – Optimal point:
A
x1 = 30 bowls
20 – x2 =0 mugs
Z = $2,100
B
10 –
x1 + 2x2 40 hr
| | | C |
0– 10 20 30 40 x1
Minimization Problem
CHEMICAL CONTRIBUTION
Brand Nitrogen (lb/bag) Phosphate (lb/bag)
Gro-plus 2 4
Crop-fast 4 3
subject to
2x1 + 4x2 16 lb of nitrogen
4x1 + 3x2 24 lb of phosphate
x 1, x 2 0
Graphical Solution
x2
14 –
x1 = 0 bags of Gro-plus
12 – x2 = 8 bags of Crop-fast
10 – Z = $24
A
8– Z = 6x1 + 3x2
6–
4–
B
2–
C
| | | | | | |
0–
2 4 6 8 10 12 14 x1
Graphical Solutions for the Special Cases of LP
i) Unboundedness
Unboundedness occurs when the decision variable increased indefinitely without violating
any of the constraints. The reason for it may be concluded to be wrong formulation of the
problem such as incorrectly maximizing instead of minimizing and/or errors in the given
problem. Checking equalities or rethinking the problem statement will resolve the problem.
Example:
Max Z = 10X1 + 20X2
Subject to 2X1 + 4X2 > 16
X1 + 5X2 > 15
X1, X2 > 0
Following the above listed steps of graphical solution method, we find the following graph
for the above model:
ii) Redundant Constraints
In some cases after plotting all the constraints on the graph, feasible area
(common region) that represents all the constraint of the problem cannot be
obtained. In other words, infeasibility is a condition that arises when no value
of the variables satisfy all the constraints simultaneously. Such a problem
arises due to wrong model formulation with conflicting constraints.
For example,
Max Z = 3X1+2X2
Subject to: 2X1 + X2 < 2
3X1 + 4X2 > 12
X1, X 2 > 0