r + 9X + 11 X4

5
4X1 + X2 xa +s 15,
X4
d i Maximize z == 3
X + X 2+
-11111
subject to
1 I/'_ + 3x + 2x4 s 120,
7X1 + 5"'2 3
+ 10X3 + 15X4 s
100,
3X1 + 5X2
X X 0.
X1, X2, 3, 4
- o·,0 zmax = -695
7.
J
55
0' x3 = -,
7 X4 -
Xt -- -50 y_ _-
fmu;w
·A- 7' •.,
X, X2, X3
F d 2x3 ,s;; 10,
X + X -
_JJ ,n 1 2 x s 20
subject to
4X1 + 3
+ '

z = 10X1 X + .
+ 2X3. [Kafyanf Hons., '98sJ
which will maximize u
h matrix wnttesis n ,n each tablea of the . .
th ba of tha t iteration. in place IOifial
[Calcutta M. Sc., 1977]
elf thea~mv
~rses t e~e of the
•yogiv
tisfytnx
Sama
basis
5 r_ _
0 "'3
= , - o·'
zmax = so.J
[S ;g X1 = '
;
l. P. P. by any method
-ll O Solve the following 0
x 1,
(i) Maximize z = 7x1 +
3~ ,
subject to x1 + 2~ > 3,
x1 + S 4,
5
X1 < 2'
3
< 2· [Jadavpur, 1984]
[ h x1 = ~, = : ; zmax = 22.J
= 4x1 + BX:! + 3Xa, x, "':!, x > 0
(ii) Minimize z 1 3
x1 + 2,
subject to
2x1 + Xa 5. [Calcutta Hons., 1~
[h X1 = ;, = = O; zmin = 1O.J
s :
P. P. by introducing artificial variable
...Jll Solve the following
Maximize z = -x1 -
L.
- x
3
x - + 2x = 2, ·
subject to 1 3
-x1 + 2x2 - Xa = 1,
X1, ~, X3 0.

fSmir xt = 0, Xi = f, Xa = f; zmax = -3.J

d to
..Jlif Use Chames Big-M me"'2,tho(x,, x O)
(i) Maximize z = 3x1 _ 2
2x, + ,
subject to 2
X1 + 3x2 S 3,

rA -
S 4.
[ Visva-Bharati. 19821
= 3, x_2 = O· Z - 9]
"-W :I X1 .. 'm ax - ·
(Ii) Maximize z = 2x _ 3 0
1 X2, X1, X2
SUb'
!ect to -x, + "'2 -2,
5 46,
x1 + 4x2 s
7x1 + 2~ 32. 19811
rA -- x.1 = 4, x_ = 2· [Calcutta Hons.,
1-. uQ 2
·'2 ' max = 2.J
 charnes M-method to solve the L. P. P.
LJS8. ·ze z := X1 + 5X2
MaXll111
~) bjeCt to 3X1 + 4X2 6 and X1 + 3x2 3,
sU X1, X2 ;:: 0. [C
where alcutta Hons., 1980)
3. z - 15 1
- x ::: 0, == 2' max - 2·
1
.. Minimize z = 4X1 + 3x2
(11) bJ·ect to X1 + 2~ ;:: 8 and 3x1 + 2~ 12,
SU > O
where X1, X2 - •
(/:lil:t X1 ::: 2, :: 3; Zmln = 17.)
1171'1 use Chames Big M-method (method of penalty) to
Jill' Maximize z = 5x1 - 2~ + 3x3
subject to 2x1 + 2x2 - x3 2,
3x1 - 4~ 3,
+ 3X3 5,
X1, X2, X3 0. [Kalyani Hons., 1982)
,~
X1
23 y_ -
= 3' ·-z -
5 ' ·x3 -- o·, zmax -- 3•
85 1

J Solve the following L P. P. :

Maximize z = 2x1 + + 3x3
subject to x1 + + 2.K:3 5,
2X1 + 3~ + 4x3 = 12,
X1, ~, X3 > 0. [Jadavpur M. Sc., 1992J
[Qml x1 = 3, = 2, Xa = O; zmax = 8.]

.JD Find the minimum value of

2X1 + 4~ + X:3
subject to x 1 + 2~ - x 3 < 5,
2x1 - + 2x3 = 2,
-x1 + 2~ + 2.K:3 1,
X1' ~• x3 0. [Kalyani Hons., 1981; Visva-Bharati Hons., 1988)
[Bml1.J

JI) Find 0, U= 1, 2, 3, 4)
subject to -2x1 + + 3x3 + X4 = 2,
-5X1 + 2~ + 3x4 - 5,
7X1 - 4~ + X3 + 4x4 1,
Whic . . . _3x1 + 2x2 + Sx3 + 6x4 10,
h will minimize the function
rt\- -10x1 + X2 + 9X3 + 8X4,
"-Ul:'8 X1 = .L 8
; Min. value = 6; .]
hi 7 ' X2 = 7 , x3 = 0, x4 =
Show th t h . •
SOiutions . a t 8 following two linear programming problems have no feasible
(i) M~imize z _
(ii) Maximize z = x1 + 4Xi + 3Xs
Subject to - ;x1 + 2x2
X1 + X2 2, subject to 2x1 - Xi + 5Xs = 40,
3x1 + 4~ 12, X1 + 2Xi - 3X:3 22,
3X1 + Xi + 2Xs = 30,
X1, X2 0.
X1, Xi, Xs O.
Check
the result (i) graphically.