Lecture 2

Graphical Methods for LPP

 Contents of the PPT

• Introduction.
• Important Definitions.
• Points to Remember.
• Steps for Graphical Method.
• Few Examples.
• Special Cases.

2
 Introduction
• After formulation of LP models, the next task is to find the
best values for decision variables.
• For LP models consisting of only two variables, the whole
problem can be plotted on a graph and the best values can
be obtained.
• In case of more than two variables, we proceed for
SIMPLEX method.

Graphical
Methods

Extreme Point Iso-Profit (Cost)

Solution Function Line
3
 Important Definitions
• Solution: The set of values of decision variables that satisfy the
constraints.

• Feasible Solution: The set of values of decision variables that

satisfy constraints along with non-negativity conditions.
Otherwise it is called Infeasible Solution.

• Basic Solution: In case we have m equations in n variables

(n>m), then a solution obtained by setting (n-m) variables as zero
and solving for the remaining m variables using m equations is
called a basic solution. The (n-m) variables are termed as non-
basic and the remaining m variables are called basic variables.
4
 Continued…
• Basic Feasible Solution (BFS): A feasible solution which is
also basic solution. Therefore, all decision variables assume
non-negative values.
BFS are generally of two types:
(a) Degenerate = if value of at least one basic variable is 0.
(b) Non degenerate = if value of all m basic variables is non-zero
& positive.

• Optimum BFS: A BFS that optimizes (max or min) the

objective function.

• Unbounded Solution: A solution that can increase or decrease

infinitely the value of objective function.
5
 Points to Remember
• The collection of all feasible solutions constitute a convex
set whose extreme (corner) points corresponds to BFS.
• A convex set is a polygon so that if we consider two
arbitrary points within the set then a line segment joining
these two points also lies in the set.
• There are finite BFS within the feasible solution space.
• Each corner (vertex or extreme) point of a feasible solution
set falls at the intersection of two constraint equalities.
• If the optimal solution occurs at more than one extreme
point, then the value of the objective function should be
same.
6
Steps for Graphical Method using Extreme
Point Solution

• Develop an LP model
Step 1

• Plot constraints on graph paper and

Step 2 decide the feasible region.

• Examine extreme points of the

feasible solution space to find an
Step 3 optimal solution.

7
 Illustration 1
• Use the graphical method to solve the following LPP

Subject to

8
 Solution
• Let as horizontal axis and as vertical axis.
• Consider the first constraint

As

• For this equation, find any two points that satisfy this
line.
• This can be obtained as:
Point 1 Point 2
0 90
60 0
9
 Continued…

• Now in order to determine which side of a constraint is in

feasible region, examine whether the origin (0,0) satisfies the
constraint. If it does then all points on and below the constraint
(i.e. towards origin) are feasible points. Otherwise, all points
away from the constraint form the feasible points.
10
 Continued…
• Since putting (0,0) gives
4*0 + 6*0 ≤ 360 (True)
Therefore the feasible region lies towards the origin.

11
 Continued…
• Consider the second constraint:

As

• The obtained feasible points are (60,0) & (0,0)

• Similarly, consider the third constraint:

• The feasible points for this line are (0,0), (0,40)

12
 Continued…

A B
3

O D

13
 Solution…

• The feasible region is the common area emerging out

of the three constraints along with non negativity
condition.
• Point B is obtained by solving constraints 1 and 3.
• Similarly, we obtain point C by equating constraints 1
and 2.
• The obtained feasible region is OABCD

14
 Continued…
A
B

FEASIBLE C

REGION

O D

15
 Continued…

Extreme Point Coordinates Objective ‘Z’

Value
O (0,0) 0
A (0,40) 400
B (30,40) 850
C (60,20) 1100
D (60,0) 900

Since the objective function value needs to be

maximized, we get an optimal solution at (60, 20)
and Z value is 1100.

16
 Illustration 2
• Solve the following LPP using graphical method

•
Subject to

17
 Solution
• We follow the same procedure performed in the
previous numerical.
• The points corresponding to constraint 1 are (0,10) &
(2,0).
• The points corresponding to constraint 2 are (0,6) &
(6,0).
• The points corresponding to constraint 3 are (12,0) &
(0,3).
• Next we need to judge whether the feasible solution
region lies towards or away from the origin.

18
 Continued…
Point A can be obtained by
O equating constraints 1 & 2.
Similarly, B can be obtained
1 by equating constraints 2 & 3.

A 2

3
B
C

19
 Continued

FEASIBLE
REGION
A

20
 Continued…

Point Coordinates Z Value

0 (0,10) 20
A (1.5) 13
B (4,2) 16
C (12,0) 36

Since the objective function needs to be

minimized, therefore the optimal solution exists
at (1,5) with Z value 13.

21
 Illustration 3
• Solve the following using graphical method:

Subject to

22
 Solution

4 5

B C 3

E
A

23
 Continued…

C
B

FEASIBLE
REGION

E
A

24
 Continued…
Extreme Coordinates Z Value
Point
A (3,3) 15
B (12,12) 60
C (18,12) 72
D (20,10) 70
E (20,3) 49

Since the objective is to maximize the model, we

get the optimal solution at (18,12) with value 72.

25
Steps for Graphical Method using Iso-
Profit (Cost) Function Line

• Identify the feasible region and extreme points

Step 1 of a feasible region.

• Draw an iso-profit (iso-cost) line for arbitrary

Step 2 values of objective function.

• Move iso-profit (iso-cost) lines parallel in

direction of increasing (decreasing) objective
Step 3 function value.

• An extreme (corner) point touched by the line

Step 4 is considered as optimal solution point.

26
 Illustration 1

• Solve the LPP using graphical method

•
Subject to

27
 Solution

A B

O D
28
 Continued…
• In order to get the iso-profit line we take different
equations such as:

These lines are plotted with dotted line and the point at
which it intersects the corner point, that point is
assumed to be optimal.

29
 Continued…

A B

FEASIBLE
REGION
O D
30
 Continued…
• Therefore, it can be observed from the graph that iso-profit
intersects at the point (60,0) for which the Z value is 1100.
• This is the optimal solution corresponding to the given problem.

• Note:
(a) For choosing Z value, a good choice is to consider a number
divisible by both the coefficients.
(b) The farthest iso-profit line may intersect at only one corner
point resulting into single optimal solution. Also, it may
coincide with any boundary of feasible region resulting into
multiple (alternative) optimal solution. However, if the lines
goes on infinitely, we infer a case of unbounded solution.

31
Extreme Iso-Profit
Point (Cost)
Solution Function

CAN YOU COMPARE THE TWO METHODS ??

32
 SPECIAL CASES IN LPP

So
Simple!! Next Topic
is Tricky… YEAH!!

33
Alternative (Multiple) Optimal Solution

• In certain cases, LPP may have more than one

optimal solution yielding the same objective value.
• In order to identify such solution graphically, the
slope of the objective function should be the same as
that of the constraint forming the boundary of the
feasible solution region. (Iso-profit function method)
• There might also be a case while using extreme point
solution that two or more corner points have same Z
vale.

34
 Example
• Use graphical method to prove whether or not the
following LPP has alternative optimal solutions:

Subject to

35
 Unbounded Solution

• When the LPP has infinite solutions.

• It happens when the value of objective function
increases infinitely, without violating feasibility
conditions.
• Graphically we can interpret it as having a feasible
region which is unbounded.
• Such solution exists due to improper formulation of
real life problems.

36
 Example

• Check for unbounded solution:

Subject to

37
 Infeasible Solution
• When there is no solution that satisfies all the
constraints simultaneously.
• This generally happens when LP model has
conflicting constraints.

• Redundancy:
A redundant constraint is one that does not affect the
feasible solution region and so is of no significance.

38
 Example
• Check for infeasibility:

Subject to

39