Scribd
Upload
14 views7 pages

L 5 Graphical Method Contd Some Important Cases 14-4

1. This document discusses three important cases that can occur when solving linear programming problems graphically: multiple optimal solutions, unbounded solutions, and no feasible solution. 2. The first example shows a problem with multiple optimal solutions at two different corner points, indicating that the maximum value is achieved at more than one solution. 3. The second example's feasible region is unbounded, meaning the maximum value of the objective function reaches infinity, resulting in an unbounded solution. 4. The third example's constraints do not intersect, so there is no feasible region. Therefore, the problem has no solution.

Uploaded by

abcd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views7 pages

L 5 Graphical Method Contd Some Important Cases 14-4

1. This document discusses three important cases that can occur when solving linear programming problems graphically: multiple optimal solutions, unbounded solutions, and no feasible solution. 2. The first example shows a problem with multiple optimal solutions at two different corner points, indicating that the maximum value is achieved at more than one solution. 3. The second example's feasible region is unbounded, meaning the maximum value of the objective function reaches infinity, resulting in an unbounded solution. 4. The third example's constraints do not intersect, so there is no feasible region. Therefore, the problem has no solution.

Uploaded by

abcd
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Some Important Cases

1. Multiple Optimal Solution;


Example: Solve the following LPP by graphical method

Max(Z) = 100x1 + 40x2

Subject to
5x1 + 2x2 ≤ 1000
3x1 + 2x2 ≤ 900
x1 + 2x2 ≤ 500
and
x1, x2 ≥ 0
Solution:
– To represent the constraints graphically the inequalities are
written as equalities.
– Every equation is represented by a straight line.
– To draw the lines, two points on each of the lines are found as
indicated in the following table (intercepts);
–
Equation x2 intercept x1 intercept Point (x, y) on
when x1 = 0 when x2 = 0 the line
5x1 + 2x2 = 1000 x2 = 500 x1 = 200 (0,500)(200,0)
3x1 + 2x2 = 900 x2 = 450 x1 = 300 (0,450)(300,0)
x1 + 2x2 = 500 x2 = 250 x1 = 500 (0,250)(500,0)

and x1 = 0, x1 axis x2 = 0, x2 axis. Plot each equation on the graph.


B is the point of intersection of lines x1 + 2x2 = 500, 5x1 + 2x2 =
1000 on solving we get B = (125, 187.5)

Corner Value of Z = 100x1 +


Points 40x2
A(0, 250) 10,000
B(125, 20,000(Max. Value)
187.5)
C(200, 0) 20,000(Max. Value)

Therefore, the Maximum value of Z occurs at two vertices B and C gives the
maximum value of Z. Thus, there are multiple optimum solution for the LPP.
2. Ubounded Solutions:

Example: Use graphical method to solve the following LPP.

Max(Z) = 3x1 + 2x2

Subject to

5x1 + x2 ≥
10 x1 + x2 ≥
6 x1 + 4x2 ≥
12
and

x1, x2 ≥ 0
Solution:
– To represent the constraints graphically the inequalities are
written as equalities.
– Every equation is represented by a straight line.
– To draw the lines, two points on each of the lines are found as
indicated in the following table (intercepts);

Equation x2 intercept x1 intercept Point (x, y) on the


when x1 = 0 when x2 = 0 line
5x1 + x2 = 10 x2 = 10 x1 = 2 (0,10)(2,0)
x1 + x2 = 6 x2 = 6 x1 = 6 (0,6)(6,0)
x1 + 4x2 = 12 x2 = 3 x1 = 12 (0,3)(12,0)

and x1 = 0, x1 axis x2 = 0, x2 axis. Plot each equation on the graph.


The feasible region is unbounded. Thus, the maximum value of Z
occurs at infinity; hence, the problem has an unbounded solution.
3. No Feasible Solution:

Example: Use graphical method to solve the following LPP.

Max (Z) = x1 + x2

Subject to
x1 + x2 ≤ 1
−3x1 + x2 ≤ 3
and
x1, x2 ≥ 0
Solution:
– To represent the constraints graphically the inequalities are
written as equalities.
– Every equation is represented by a straight line.
– To draw the lines, two points on each of the lines are found as
indicated in the following table (intercepts);

Equation x2 intercept x1 intercept Point (x, y) on the


when x1 = 0 when x2 = 0 line
x1 + x2 = 1 x2 = 1 x1 = 1 (0,1)(1,0)
−3x1 + x2 = 3 x2 = 3 x1 = −1 (0,3)(-1,0)

and x1 = 0, x1 axis x2 = 0, x2 axis. Plot each equation on the graph.


In the above graph, there being no point (x1, x2) common to both the shaded regions. We
cannot find a feasible region for this problem. So the problem can not be solved,
hence, the problem has no solution.

You might also like