Multiple Optimal Solutions

Can exist for a linear programming problem if

i. The given objective function is parallel to a constraint that forms the boundary
of the feasible solutions region
ii. The constraint should form a boundary on the feasible region in the direction
of the optimal movement of the objective function. In other words, the
constraint must be a binding constraint.
In case the slope of the objective function (represented by the iso-profit lines) is the
same as that of a constraint, then multiple optimal solutions might exist. For
multiple optimal solutions to exist, the following two conditions need to be
satisfied:
(a) The objective function should be parallel to a constraint that forms an edge or
boundary on the feasible region; and
(b) The constraint should form a boundary on the feasible region in the direction
of optimal movement of the objective function. In other words, the constraint
must be a binding constraint.

4. Solve graphically the following LPP:

Maximise Z = 8x 1 + 16x 2
Subject to
x 1 + x 2 ≤ 200
x 2 ≤ 125
3x 1 + 6x 2 ≤ 900
x1, x2 ≥ 0

Solution:
The constraints are shown plotted on the graph in Figure 4.5. Also, iso-profit lines
have been graphed. We observe that iso-profit lines are parallel to the equation for
third constraint 3x 1 + 6x 2 = 900. As we move the iso-profit line farther from the
origin, it coincides with the portion BC of the constraint line that forms the
boundary of the feasible region. It implies that there are an infinite number of
optimal solutions represented by all points lying on the line segment BC, including
the extreme points represented by B (50, 125) and C (100, 100). Since the extreme
points are also included in the solutions, we may disregard all other solutions and
consider only these ones to establish that the solution to a linear programming
problem shall always lie at an extreme point of the feasible region.
The extreme points of the feasible region are given and evaluated here.
Point x1 x2 Z = 8x 1 + 16x 2
 0 0 0 0
A 0 125 2000
B 50 125 2400
C 100 100 2400 } Maximum
D 200 0 1600
The point B and C clearly represent the optima.
In this example, the constraint to which the objective function was parallel, was the
one which formed a side of the boundary of the space of the feasible region. As
mentioned in condition (a), if such a constraint (to which the objective function is
parallel) does not form an edge or boundary of the feasible region, then multiple
solutions would not exist.

X2

200

Optimal Solutions
150

A B X2 = 125

100 C

FEASIBLE
50
REGION Iso-profit lines

0
D E
100200300X1