LINEAR PROGRAMMING

Lecture III
GRAPHICAL METHOD
by
Dr. KUSUM DEEP
Professor
Department of Mathematics
Indian Institute of Technology Roorkee
Roorkee 247667, Uttaranchal, INDIA
Emails: kusumfma@iitr.ernet.in, kusumdeep@gmail.com
 OUTLINE OF THIS TALK

Definition of 2-dimensional LPP

Four cases
Unique solution
Multiple solution
Unbounded solution
Infeasible solution
Exercises
 2dim Linear Programming
Problem
Min/ max c1x1 + c2x2
Subject to
a11x1 + a12x2 < b1
a21x1 + a22x2 < b2
-----
am1x1 + am2x2 < bm
x1 , x2, b1, b2 > 0
 Four cases
1. Unique solution
2. Multiple solution
3. Unbounded solution
4. Infeasible solution
 1. Unique solution
Maximize 5x1 + 3x2
Subject to x1 + x 2 < 5
3x1 + 8x2 < 24
x1 > 0, x2 > 0
 x2

(0, 5)

A(0, 3)
B(16/5, 9/5)

x1

O(0, 0) C(5, 0) (8, 0)

 Vertices of Objective function value
feasible region 5x1 + 3x2
O(0, 0) 0
A(0, 3) 9
B(16/5, 9/5) 21.4
C(5, 0) 25 Max
 2. Multiple solutions
Maximize 3x1 + 8x2
Subject to x1 + x 2 < 5
3x1 + 8x2 < 24
x1 > 0, x2 > 0
 x2

(0, 5)

A(0, 3)
B(16/5, 9/5)

x1

O(0, 0) C(5, 0) (8, 0)

 Vertices of Objective function value
feasible region 3x1 + 8x2
O(0, 0) 0
A(0, 3) 24 max
B(16/5, 9 /5) 24 Max
C(5, 0) 15
 3. Unbounded solutions
Maximize 3x1 + 8x2
Subject to 2x1 x2 > 0
x2 < 4
x1 > 0, x2 > 0
 x2

A(2, 4) B(t, 4)
(0, 4)

x1

O(0, 0) C(t, 0)
 Vertices of Objective function value
feasible region 3x1 + 8x2
O(0, 0) 0
A(2, 4) 38
B(t, 4) 6 + 8t
C(t, 0) 8t

As t increases 6 + 8t also increases

 4. Infeasible solution
Maximize 3x1 2x2
subject to x 1 + x2 < 5
x1 + x2 > 6
x 1, x 2 > 0
 x2
(0, 6)

(0, 5)

x1

O(0, 0) (5, 0) (6, 0)

 Exercises
Solve the following LPP using Graphical Method:
1. Max 5x + 8y s.t. 3x + 2y < 36; 3x + 4y > 24; x,y > 0.
Ans: (0, 18)

2. Min 5x + 2y s.t. x + 4y > 4; 5x + 2y > 10; x, y > 0.

Ans: All points between (0,5) & (16/9, 5/9).

3. Max 5x y s.t. 2x + 3y > 12; x 3y > 0 ; x, y > 0.

Ans: Unbounded
 THANK YOU
1/18/2016 17