Example 4.
(Unbounded Solution) Find the maximum value of
z= 3x + 2y; subject to the constraints:
X - ys 1, x+ y> 3; and x > 0, y2 0.
Solution. Step 1. To graph the constraints of the LPP, consider the OXY plane. Cle:
{* - y s 1) represents the region 'on the left' of the line - y = 1and { + y
23} represents
region 'on the right' of the line x + y = 3.
Step 2. The solution space (feasible region) is the intersection of all the
first quadrant. This is shown shaded in the Fig. 3.17 below constraint regions in
:
Y
A Feasible
region X-y= 1
x+y=3
B
Fig, 3.17.
Linear Programming Problem--Graphical Method
OR
Sten 3. The feasible region is unbounded to the rightof
Sten 4. Value of the objective function z at the the line joining extreme points Aan
extreme points (2, 1) and (0, 3) are 8 anc
respectively.
But there exist points in the solution space for which the value of the
than 8. For instance, at the point (4, 5), the value for z is 22. It can objective
be
function is mo
considering still higher points. Thus, we conclude that the maximum value offurther increased b
z occurs at infinit
We conclude that the given problem has an unbounded solution.
Example 5. (No Solution) Find the minimum value of
z = -3x + 4y; subject to the constraints:
x + ys 4, 2x + 3y > 18; and x 2 0, y >0.
[B.Com., Madras Univ. (Nov.) 2007]
Solution. Step 1. Consider the OXY plane. Here, {x +y s 4} represents the region on the leftr
or2r +the3y line
=18.
x+y=4 and {2x + 3y 218} represents the region on the right of the line
Srep 2. The feasible regions for the two inequalities x + y s 4 and 2x + 3y 2 18 are depicted in
Fg 3.18. The twoshaded regions indicate two half-spaces which do not intersect and thus have no
point in common.
Y
and
Band
Or
30 sr2r+3y =18
and
ptim
2
1 X+y =4
pom 11 2 3 4 5 6 8
Fig. 3.18.
simultaneously, we conclude that
thereSiisnce,no there is no point (x, y) which can lie in both the regions
feasible solution to the given LPP.
Ubes not pose any ts to
Example 3.
stabilizers : (Alternative Optimal Solution) problem in themnake the
case of
Ordinary and
and only assembly Auto-cut.
A
All components company
SOurces
and testing is carried out atof thethe manufactures
stabilizers are
two models of
voltage
he testing time required for the two
comparny's
models are 0.8 hour each for own purchased
works. from outside
Auto-cut.
Manufacturing
The market for the twocapacity
models
of 720 hours at
present Ordinary
is available
the assembly and
and 1.20 hours each for
units of ordinary and 400 units of
has been surveyed which per week.
been estimated at Rs. 100 and Rs. 150Auto-cut. Profit per unit for suggests maximum weekly sale of 600
(a Find the optimal product mix respectively. Ordinary Auto-cut models has
and
(i) Is there an alternative using graphical method.
optimal solution? If yes, specify it.
Solution. Let be the
ctabilizers to be manutactured.number of Ordinary
stabilizers and y be the number of Autoct
Then, the linear programming
Maximize z = 100x + 150y ; subject to the formulation of the problem is:
0.8x + 1.2y < 720 constraints
:
xS 600
ys 400
(Manufacturing capacity)
(Ordinary models)
x>0 and y0 (Auto-cut models)
Sten 1. To graph the constraints of the
LPP, (Non-negativity)
{0.8x + 1.2y S 720} and {r s 600} represents theconsider regions
the OXY plane. In this plane.
on the left of the lines
08x +1.2y = 720 and x = 600 respectively. Also {ys
y= 400. 400} represents the region below the line
Step 2. The solution space is the intersection of all regions
in the first quadrant. Thus, we get the feasible region OABCD shownrepresented by the given constraints
shaded in Fig. 3.16.
Step 3. Since, the solution space is bounded by the lines 0.8x + 1.2y = 720, x = 600 and
y= 400, its extreme points are :
O= (0, 0), A =(600, 0), B = (600, 200), C = (300, 400) and D = (0, 400).
OR-3-12 Operatlons LinearProgr
Step
600 Step s
= 400 respectiv
D But t
than 8.
0.8x +1.2y =720 conside
Feasible B
region Wecon
Exa
0 A
Fig. 3.16.
Step 4. Values of the objective function at the extreme points are now evaluated : of th
Extreme point X-coordinate y-coordinate Profit : (100x + 150 2x +
0 0
A 600 0 60,000
Fig
B 600 200 90,000 poin
C 300 400 90,000
D 0 400 60,000
Step 5. The objective function attains its maximum at two extreme points B = (600, 200) and
C=(300, 400). This suggeststhe presence of more than one optimal solution and we say that Ban
Care two alternative optimal solutions.
Hence, the company should manufacture either 600 Ordinary and 200 Auto-cut stabilizers or 31
Ordinary and 400 Auto-cut stabilizers to achieve a maximum profit of Rs. 90,000 per week.
Note. It may Be observed that any point on the line segment joining extreme points Band (
also gives a maximum z-value of Rs. 90,00. Thus in this case there is an infinite number of optim
solutions. In fagt there are two coner point solutions and an infinite number of non-corner point
optimal solutiøns.
