Professional Documents
Culture Documents
L02 - Graphical Solution of Two Variables
L02 - Graphical Solution of Two Variables
L02 - Graphical Solution of Two Variables
3A Page 26(Modified)
Electra produces two types of electric motors,
each on a separate assembly line. The respective
daily capacities of the two lines are 150 and 200
motors. Type I motor uses 2 units of a certain
electronic component, and type II motor uses
only 1 unit. The supplier of the component can
provide 400 pieces a day.The profits per motor
of types I and II are $8 and $5 respectively.
Formulate the problem as a LPP and find the
optimal daily production.
z 8 x1 5 x2
x1
150
x2 200
2 x1 x2 400
x1 , x2 0
Graphical solution
x2
Maximize z=8x1+5x2
Subject to the constraints
Optimum
=1800 at
(100,200)
(0,200)
z=1200
z=1000
z=400
(150,0)
(150,100)
z=1800
z=1700
2x1+x2 400
x1
150
x2 200
x1,x2 0
x1
x1 + 3 x2 15
2 x1 + 2 x2 20
3 x1 + 2 x2 24
x1, x2 0
(0,12)
z = 26
z = 30
z= 36
z = 39
(4,6)
z = 22.5
z = 42
Minimum at (7.5,2.5)
(15,0)
Maximize z = 2x1 + x2
Subject to
x1 + x2 40
4 x1 + x2 100
x1, x2 0
(0,40)
z maximum at
(20,20)
(25,0)
Maximize z = 2x1 + x2
Subject to
x2 10
2 x1 5 x2 60
x1 x2 18
3 x1 x2 44
x1 , x2 0
z is maximum at (13, 5)
Max z = 31
(0,10)
z = 28
(5,10)
(10,8)
z = 20
(13,5)
z = 10
z = 31
z=4
(14.6,0)
[4]
[1]
[3]
[2]
Exceptional Cases
Usually a LPP will have a unique optimal
solution. But there are problems where
there may be no solution, may have
alternative
optimum
solutions
and
unbounded solutions. We graphically
explain these cases in the following slides.
We note that the (unique) optimum
solution occurs at one of the corners of
the set of all feasible points.
x1
150
x2 200
2 x1 x2 400
x1 , x2 0
Graphical solution
Maximize z=10x1+5x2
Subject to the constraints
x2
2x1+x2 400
(100,200)
(0,200)
z=600
z=1500
z maximum
=2000 at
z=2000
z=1000
z=400
(150,100)
(150,0)
x1
150
x2 200
x1,x2 0
x1
Maximize z = 5x1 + 7 x2
Subject to
2 x1 -
x2 -1
- x1 + 2 x2 -1
x1, x2 0
No feasible solution
Maximize z = x1 + x2
Subject to
z=70
- x1 + 3 x2 30
- 3 x1 + x2 30
z=50
x1, x2 0
z=30
unbounded solution
z=20
Convex sets
A subset S in the n-space Vn is called
convex if x, y belong to S implies the line
segment joining them also lies in S.
convex subset
NOT convex
Extreme point