M.Sc.

in Power system Engineering

Department of Electrical Engineering
IOE/Pulchowk

Tutorials on Linear programming problems

(Optimization) Last date of submission : 2066/03/23

Q1 State the following problem in standard

form Maximize Z =2 X X +5 X
1 2 3

Subject to X 12 X 2+ X
3 X12 X218
2 X1+ X22 X34
X 1 , X20, X unrestricted in sign.
Solution:
Since
X3 is unrestricted in sign, so it is expressed as difference of two non negative terms of X' 33X''
.
i.e; '
Where
X = X X
X' 3
333
X3''0
Standard form of the given L.P. problem is
X +5 X ( X '3
Z =2 X 12 )
'' 3

Z =2 X X123
+5 X' 5 X'' 3
Subjected to
' ''
X 2 X + X X +S
=8
3 X1+2 X 2' S2=18
''
2 X X +2 X 2 X S =4
1 2 3 3 3
' ''
X , X , X , X , S , S , S 0
1 2 3 3 1 2 3
Obtain the standard form of the following problem and express it in the canonical form.
2
Indicate the basic and non basic variables in the canonical form.
Maximize
Z =8 X 2 +3
Subject to
3 X 1+ 2 X2+
7 X2 +2 X3108
5 X 2+ 4 X
X , X2 , X 30
How many1 basic s will this system have?
solution
Solution:
Standard form of the given L.P. problem is
Maximize
Z =8 X2 +3 X
3

Subjected to
3 X1+ 2 X2+
7 X2+2 X3 + 1S
5 X 2 4 X3 +
X1 , X2 , X 3 , S1 , S20
Shyam Kumar Yadav Roll No. :-2065/MSP/ 711
 X1 , X2 , X 3 , S1 , S20
Canonical form
Maximize
Z =8 X2 +3 X3
Subjected to
2 1
X + X + X =2
1
3 2 3 3
+2 X 3 +are
7 X2variables
Here, Basic
. 5 X 2 4X1X, 3S+1
Non- basic variables are
S2=35X1 , X2 , X 3 , S1 ,
. X2 , X3
No. of basic solutions (n, m)
= n = ( 5 )=10
(n m ) (m ) (53 ) (3 )
Therefore, there are 10 basic solutions.

3. Find the solution of the following system by reducing it to the canonical form using pivotal operation.
6 X12 X 2+3 X 3=
4 X 1 +7 X 2 + X3=21
5 X1+ 8 X2+ 9
Solution:
Performing pivotal operation on a11
X 1 X +1 X =11 I I o
123 1 =
326 6
0+25 X X =41 II =II 4 I
23 1o1
3 3
0+29 X +13 X =233 III =III 5 I
23 1o1
326
Again, Performing pivotal operation a22
on 23 119 1
X +0+ X = I =II + I
1 3 2 2
50
3 50
41 3 1
0+ X X = II
2
25 3 25 2
383 1143 29
0+0+ X= III = III II
3 2 1 2
50 50 3
Finally,
Performing, Pivotal operation on a33
23
1 X +0
2 X +03 X =1 I =I 32 III 3
50
0 X + X +0 X =2 II =II +3 III
12 3 32 3
25
50
1 23 3
Hence, the0 solutions
X +0 X + are
X =3 III =III 2 323
X 1=1
X 2=2
X 3=3
 X 1=1
X 2=2
X 3=3
4. Find the solution of the following LP problem
graphically: Maximize
Z =2 X 1+ 6
Subject to
X1+ X21
2 X1+ X22
X1 , X20
Solution:-
Let us consider two given equations for plotting the graph.
The equations are
X1+ X2=1 .. . . .. . . .. . . .. . . .. . . .. . .(i)
2 X 1 +X2=2 . .. . . .. . . .. . . .. . . .. . . .. . . .. (ii )
For equation (i),
X1+ X2=1 .
X2 0 1 2 3
X1 -1 0 1 2
For equation (ii),
2 X1+ X2=2 .
X2 0 2 4 6
X1 1 0 -1 -2
The point of intersection of these two lines is found by solving these above two equations.

2 X 1 +2 X 2=
2
2 X 1+ X 2=2
or 3 =44 =1 .
, XX2=
2
3


Putting the values of
X2
in equation (i), we get
4
X + =1
1
or, 3 4
X =1
1
1 3
X = =0 .
33
Now, from the graph,
At vertex A(0,0)
Z =2 X + 6
1
At vertex B(1,0)
X2=20+60=0
Z =2 X 1 + 6 X2=21+
At vertex C(0.33,1.33)
60=2
Z =2 X + 6 X2=20 .33+ 61 .
At vertex D(0,1)1
33=8. 64
Z =2 X1+ 6 X2=20+61=6
Since the values of Z is 8.64 which is maximum point of intersection C(0.33,1.33). So, it is optimal point.
Hence, the solution is
Z =8 . 64
X1=0 . 33
Shyam Kumar Yadav Roll No. :-2065/MSP/ 711
X2=1 . 33
 Z =8 . 64
X1=0 . 33
X2=1 . 33
5. Use Simplex algorithm to determine the optimum feasible solution of the following LP problems:
(a)Maximize Subject
Z =5 X1+ 4 X2
to
6 X1 +4 X224
X1 +2 X26
X1+ X21
X 22
X1 , X20
Solution:-
Standard form of Linear programming is
Maximize
Z =5 X 1+ 4
Subject to
X2
6 X 1 +4 X 2 + S1=24
X 1 +2 X 2 + S2 =6
X 1+ X2+ S3=1
X2 +S4=2
X 1 , X 2 , S1 , S 2 , S 3 ,
e.v.
Table I
Basis Z X1 X2 S1 S2 S3 S4 Solution Ratio
Z S1 S2 S3 1 -5 -4 0 0 0 0 0
S4 0 6 4 1 0 0 0 24
L.V. 4 Smallest
0 1 2 0 1 0 0 6
6
0 -1 1 0 0 1 0 1
-1
0 0 1 0 0 0 1 2
-

e.v.
Table II
Basis Z X1 X2 S1 S2 S3 S4 Solution Ratio
Z 1 0 2
3
5
6
0 0 0 20
X1 0 1 2
3
1
6
0 0 0 4 6
L.V. S2 0 0 4
3
1
6
1 0 0 2 3/2
smallest
S3 0 0 5
3
1
6
0 1 0 5 3
S4 0 0 1 0 0 0 1 2 2
Table III
Basis Z X1 X2 S1 S2 S3 S4 Solution Ratio
3 1
Z 1 0 0 4 2 0 0 21
X1 0 1 0 0.25 -0.5 0 0 3
1 5
X2 0 0 1 8 4
0 0 1.5
3 5
S3 0 0 0 8 4
1 0 2.5
1 3
S4 0 0 0 8 4 0 1 0.5

Shyam Kumar Yadav Roll No. :-2065/MSP/ 711

 Since all the coefficients of Z row non basic variables are non negative and all the
values in RHS are positive. The solutions are optimum and feasible.

(b) Maximize
Z =2 X 1 + 4 X
Subject to
2
X1 +2 X25
X 1 + X 2 4
X1 , X20
Standard Canonical Form
Maximize
Z =2 X 1+ 4
Subject to
X 1 +2 X 2 +
SX1 =5
1 + X 2 +S 2 =4
X 1 , X 2 , S1 , S 2
e.
Table I v.
Basis Z X1 X2 S1 S2 Solution Ratio
Z 1 -2 -4 0 0 0

L.V. S1 0 1 2 1 0 5 2.5 smallest

S2 0 1 1 0 1 4 4

Basis Z X1 X2 S1 S2 Solution Ratio

Z 1 0 0 2 0 10
X2 0 0.5 1 0.5 0 2.5
S2 0 0.5 0 -0.5 1 1.5
Since all the coefficients of Z row coefficient of all non basic variables are non negative so the solution is
optimum.
But the z row coefficient non basic variabl eX1 is zero. Hence the given L.P. problems have infinite number of
solutions.
(c) Minimize
Z =3 X 12
Subject to
 X 1 X21
3 X12 X26
X 1 , X2 0
Solution:-
The standard form of given linear programming
is Minimize
Z +3 X 1+2
Subjected to
X 1 X2 + S1=1
3 X12 X2 +S2=6
X 1 , X 2 , S1 , S2
Tabular
form e.v.
 Table I
Basis Z X1 X2 S1 S2 Solution Ratio
smallest Z 1 3 2 0 0 0
L.V.
S1 0 1 -1 1 0 1 1
S2 0 3 -2 0 1 6 2
e.v.
Table II
Basis Z X1 X2 S1 S2 Solution Ratio
Z 1 0 5 -3 0 -3
X1 0 1 -1 1 0 1 -1
L.V. smallest
S2 0 0 1 -3 1 3 3
Table III
 Basis Z X1 X2 S1 S2 Solution Ratio
Z 1 0 0 12 -5 -18
X1 0 1 0 -2 1 4
X2 0 0 1 -3 1 3
Since coefficient of Z rows are not positive solution is unbounded
6. Use two phase simplex method to solve the following LP problem
Minimize Z =3 X1+ 2
Subject to
X2
3 X 1 + X 2 3
4 X1+3 X26
X 1 +2 X 2 4
X1 , X20
Solution:
Standard form of Linear programming is
Minimize
Z =3 X 1 + 2
Subject to X2
3 X1+ X2 S1=3
4 X1+3 X2S2=6
X1 + X2 +S3=3
X 1 , X 2 , S1 , S 2 ,
esR R .
Since these equations do not give initial basic solutions, Let us introduce the artificial variabl
1 2
To Get that,
Minimize
Z =3 X1 + 2
Subjected to
3 X 1+ X2 S1 +
R41=3
X 1 +3 X 2 S 2 + R 2=6
X1 + X2 +S3=3
X 1 , X 2 , S1 , S2 , R 1 ,
Defining auxialiary objective function W

Minimize W =R 1 +
Substituting values of R1 & R2
=33
W X 1 X 2+ S 1+64 X13 X 2+ S2
=7 X 1 4 X2+ S1 +S2+ 9
 =7 X 1 4 X2+ S1 +S2 + 9
Subjected to
3 X1+ X2S1 + R1=3
4 X 1 +3 X2 S2+ R 2 =6
X 1 + X 2 +S3=3
X 1 , X 2 , S1 , S 2 , R 1 ,
e.v.
Table I
Basis W X1 X2 S1 S2 S3 R1 R2 Solution Ratio
W 1 7 4 -1 -1 0 0 0 9
L.V. R1 0 3 1 -1 0 0 1 0 3 1 Smallest
R2 0 4 3 0 -1 0 0 1 6 3/2
S3 0 1 1 0 0 1 0 0 3 3
e.v.

Basis W X1 X2 S1 S2 S3 R1 R2 Solution Ratio

W 1 0 5/3 4/3 -1 0 -7/3 0 2
X1 0 1 1/3 -1/3 0 0 1/3 0 1 3
L.V.
R2 0 0 5/3 4/3 -1 0 -4/3 1 2 6/5 Smallest
S3 0 0 2/3 1/3 0 1 -1/3 0 2 3

Basis W X1 X2 S1 S2 S3 R1 R2 Solution Ratio

W 1 0 0 0 0 0 -1 -1 0
X1 0 1 0 -3/5 1/5 0 3/5 -1/5 3/5
X2 0 0 1 4/5 -3/5 0 -4/5 3/5 6/5
S3 0 0 0 -1/5 2/5 1 1/5 -2/5 6/5
Now, Since the W-row coefficient of non basic variable R1 & R2 are non-positive and RHS is
non negative. Hence the solution is optimum and feasible.
Again, since W= 0, start phase II of simplex method.
Phase II
Eliminating the columns of R 1 & R2 in the optimum table of phase-I and eliminating the
original L.P. problem in the form of non basic variables.
We can write X 1=
53 5(
+ S1 S 2
3 1
5 )
X2
(6 4 S
= 1+
3
S2
)
55 5
Minimize Z =3 X
1+ 2X 2
6 4 3
1
5 5 5 5 5 5
21/ 5+1/ 5 S 1 +3 /5
Subjected to
X 3 S +1 S =3
112
55 5
X +4 S 3 S =6
212
55 5
12 6
S1+ S 2+ S 3=
55 5
In tabular form,
Basis Z X1 X2 S1 S2 S3 Solution Ratio
 Z 1 0 0 -1/5 -3/5 0 21/5
X1 0 1 0 -3/5 1/5 0 3/5
X2 0 0 1 4/5 -3/5 0 6/5
X3 0 0 0 -1/5 2/5 1 6/5
Since all the Z-row coefficients of non-baic variables are non-positive and RHS column is non negative, the solution is optimum and feasible.
Required solutions are: Check: 3 6 Z =21
X1= 5 X2= 5
5

7 Solve the following 33LP problem

26 =21 by Dual simplex method:
Z =3 X 1 + 2 X 2 =5+
Minimize 55
Z =4 X 1 + X 2
Subject to
3 X1+
4 X1+3 X26
X1 +2 X24

X1 , X20
Solution:-
Standard form of the above problem is
Minimize
Z =4 X 1 + X 2
Subject to
3 X1+
3 X1+
4 XX 2 3
1+3 X26
X1 +2 X24

X1 , X 20
Now, the standard form of L.P. is
Minimise
Z =4 X1+ X2
Subjected to
3 X1+ X2+
3 X1X2 +S2=3
4 X 13 X 2 +
X 1 +2 X 2 + S 4 =4
X 1 , X 2 , S1 , S2 , S3 ,
e.v.

Basis Z X1 X2 S1 S2 S3 S4 Solution
Z 1 -4 -1 0 0 0 0 0
S1 0 3 1 1 0 0 0 3
S2 0 -3 -1 0 1 0 0 -3
L.V. S3 0 -4 -3 0 0 1 0 -6 Minmum
S4 0 1 2 0 0 0 1 4
Ratio 1 1/3 e.v.
 Basis Z X1 X2 S1 S2 S3 S4 Solution

Z 1 -8/3 0 0 0 -1/3 0 2
S1 0 5/3 0 1 0 1/3 0 1
L.V. S2 0 -5/3 0 0 1 -1/3 0 -1 Minmum
X2 0 4/3 1 0 0 -1/3 0 2
S4 0 -5/3 0 0 0 2/3 1 0
Ratio 8/5 1

e.v.

Basis Z X1 X2 S1 S2 S3 S4 Solution Ratio

Z 1 -1 0 0 -1 0 0 3
S1 0 0 0 1 1 0 0 0
S3 0 5 0 0 -3 1 0 3
X2 0 3 1 0 -1 0 0 3
L.V. S4 0 -5 0 0 2 0 1 -2 Minmum
Ratio 1/5 1

Basis Z X1 X2 S1 S2 S3 S4 Solution Ratio

Z 1 0 0 0 -7/5 0 -1/5 17/5
S1 0 0 0 1 1 0 0 0
S3 0 0 0 0 -1 1 1 1
X2 0 0 1 0 1/5 0 3/5 9/5
X1 0 1 0 0 -2/5 0 -1/5 2/5

Since the coefficient of non basic variable in the Z-row are non positive and all the values of
RHS column are non-negative, the solution is optimum.
The solution is 17/5.
Check

() 29
Z =412X + X =4+ = +=
55
89
55
17
5

8. Consider the following LP

problemzeMaximi
Z =6 X1 +7 X2 +3 X3 +5 X4
Subject to
5 X 1 + 6 X 2 3 X 3+ 4 X
X 2 + 5 X 3 + 6
2 X 1 +5 X 2+ X 3+ X 4
X1 , X2 , X 3 , X 40
Indicate different methods for solving this problem and give the starting table in each case. Solve the
problem by two phase simplex technique.
Solution:-
The given L.P. problem can be solved by following two methods.
Dual simplex.
Two phase simplex.
i) Starting table for dual simplex method,
Minimize Z =6 X1 +7 X2 +3 X3 +5 X4
 Z =6 X1 +7 X2 +3 X3 +5 X4
Subj ted to
5 X 1 6 X 2 +3 X 3 4 X 4+
ec
X 2 + 5 X 3 + 6 X 4 +
2 X 15 X 2 X 3 X 4+
X 1 , X 2 , X 3 , X 4 , S1 , S 2 ,

Basis Z X1 X2 X3 X4 S1 S2 S3 Solution Ratio

Z 1 -6 -7 -3 -5 0 0 0 0
S1 0 -5 -6 3 -4 1 0 0 -12
S2 0 0 -1 5 6 0 1 0 -10
S3 0 -2 -5 -1 -1 0 0 1 -8
(ii) Two Phase Simplex method:
Phase I:
Z =6 X1 +7 X2 +3 X3 +5 X4

Minim 5 X 1 + 6 X 2 3 X 3+ 4 X 4 S1+ R 1=12

X 2 5 X 36 X 4 S 2 + R 2 =10
ize 2 X 1 +5 X 2 + X 3+ X 4 S 3 + R3= 8
X 1 , X 2 , X 3 , X 4 , S1 , S 2 , S 3 , R1 , R 2 ,
Subje

cted to

Let W= auxiliary
objective function.
MinimizeW =R 1 + R 2 + R3=7 X 1 12 X 2+7 X 3+ X 4 +S 1 + S 2 +
Subjected to
5 X 1 + 6 X 2 3 X 3+ 4 X 4 S1+
R 1 =12
X 2 5 X 36 X 4 S2+ R 2 =10
2 X 1 +5 X 2 + X 3 +
e.v. X S + R = 8
4 3 3

Basis W X1 X2 X3 X4 R1 R2 R3 S1 S2 S3 Solutio 30 Ratio

W R1 R2 1 7 12 -7 -1 0 0 0 -1 -1 -1 12
R3 0 5 6 -3 4 1 0 0 -1 0 0 10 2
0 0 1 -5 -6 0 1 0 0 -1 0 8 10
0 2 5 1 1 0 0 1 0 0 -1 8/5
L.V.

e.v.

Basis W X1 X2 X3 X4 R1 R2 R3 S1 S2 S3 Solutio Ratio

W 1 11/5 0 -47/5 -17/5 0 0 -12/5 -1 -1 7/5 54/5
L.V. 0 13/5 0 -21/5 14/5 1 0 -6/5 -1 0 6/5 12/5 12/13
R1
R2 0 -2/5 0 -26/5 -31/5 0 1 -1/5 0 -1 1/5 42/5
X2 0 2/5 1 1/5 1/5 0 0 1/5 0 0 -1/5 8/5 4
 e.v.
S3
Basi W X1 X2X3X4R1R2 R3 S1 S2 5/13 Solutio Ratio
W 1 0 0-76/13-75/13-11/130 -18/13 -2/13 -1 6/13 114/13
X1 R2 X2 0 1 0-21/1314/135/130 -6/13 -5/13 0 5/13 12/13
L.V. 0 0 0-76/13-75/132/131 -5/13 5/13 -2/13 2/13 -1 -5/13 114/13 2
0 0 111/13-3/13-2/130 0 16/13 114/5
-16/5

e.v.
 Basis W X1 X2 X3 X4 R1 R2 R3 S1 S2 S3 Solutio Ratio
n
W 1 -5/6 0 -9/2 -20/3 -7/6 0 -1 1/6 -1 0 8
S3 0 13/6 0 -7/2 7/3 5/6 0 -1 -5/6 0 1 2
L.V. R2 0 -5/6 0 -9/2 -20/3 -1/6 1 0 1/6 -1 0 8 48
X2 0 5/6 1 -1/2 2/3 1/6 0 0 -1/6 0 0 2

Basis W X1 X2 X3 X4 R1 R2 R3 S1 S2 S3 Solutio Ratio

W 1 0 0 0 0 -1 -1 -1 0 0 0 0
S3 0 -2 0 -26 -31 0 5 -1 0 -5 1 42
S1 0 -5 0 -27 -40 -1 6 0 1 -6 0 48
X2 0 0 1 -5 -6 0 1 0 0 -1 0 10
Now the W. row coefficient of non-linear basic variable R 1 , R2 &R3 are non positive and RHS is non negative. Hence
the solution is optimum and feasible.
Again W=0 Start phase II of simplex method.
Phase
II Minimize Z =6 X1 +7 X2 +3 X3 +5 X4
=6 X 1 +7 ( 10+ 5 X 3 + 6 X 4 + S2 )+3 X 3 +5
Z =6 X1 +38 X3 +47 X 4 +7 S2+70
Subjected to
2 X 126 X331 X 45 S 2 +
S 3=42
5 X1 27 X 3 40 X 4+ S16
S 2X=48 X X3 X4 S1 S2 S3 Solution Ratio
Basis Z 1 2

Z 1 -6 0 -38 -47 0 -7 0 70
X2 0 0 1 -5 -6 0 -1 0 10
S1 0 -5 0 -27 -40 -1 -6 0 48
S3 0 -2 0 -26 -31 0 -5 1 42
Since the Z-row coefficient of non basic variable are non-positive and RHS column is non negative, the solution is
optimal and feasible.
The Solution is
X1=0
X2=10
X3=0
X 4=0
Z =70
9) Write the dual of the following LP problem:
Maximize
Z =70 X 1 + 110
Subject to X2
3 X 1 + 5 X2800
4 X 1 + 6 X2900
5 X1+ 8
X 2 300
X1 , X20
Solution:-
 The dual form of the given LP problem
is Minimize
V =800 y 1 + 900 y2+1200 y3+300
Subjected to
3 y1+4 y2+5 y370
5 y 1 +6 y 2 + 8 y3 + y4110
y1 , y2 boards
Two types of printed circuit 40
, y3 , yA and B are to be produced in a computer manufacturing company. The
10
component placement time, soldering time and inspection time required in producing each unit of A and B are given
below.
Circui Time required per unit (min) for
t Component
Soldering inspection
Board placement
A 16 10 4
B 10 12 8
The amount of time available per day for component placement, soldering and inspection are 1500, 1000 and
500minutes respectively. If each unit of A and B contributes a profit of $10 and $15 respectively, determine the number
of units of A and B to be produced per day to maximize the profit.
Solution:
Let X1=No.of units of type A printed circuit
board. X2=No. of units of type B printed
circuit board.
Objective function
Maximize
Z =10 X 1 + 15
Subjected toX
2
16 X 1 +10 X21500
10 X 1+ 12 X
21000
4 X 1+ 8 X 2500
Standard form of theXlinear 2 0
1 , Xprogramming problem
is Maximize Z =10 X 1 + 15
Subjected to X2
16 X 1 +10 X 2 + S1=
1500
10 X 1+ 12 X 2 +
S2=1000
X 1 + 8 X 2 + S3 =500
4e.v.

Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 -10 -15 0 0 0 0
S1 0 16 10 1 0 0 1500 150
S2 0 10 12 0 1 0 1000 1000/12
L.V. S3 0 4
e.v. 8 0 0 1 500 500/8 Smallest

Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 -5/2 0 0 0 15/8 1875/2

S1 0 11 0 1 0 -5/4 875 875/11
L.V. S2 0 4 0 0 1 -3/2 250 250/4 Smallest
 127 X 1 +213 X 2 + 394 X 3 + S1=100
5 X 1 + 7 X 2 + 10 X 3 + S2=500
2 X 1 + 4 X 2 +6 X 3 + S3= 35
X2 0 1/2 1 0 0 1/8 125/2 125

Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 0 0 0 5/8 15/16 4375/4
S1 0 0 0 1 -11/4 61/8 375/2
X1 0 1 0 0 1/4 -3/8 125/2
X2 0 0 1 0 -1/8 5/16 125/4
Since Z-row coefficient of all the non basic variables are non negative and all RHS column are also non negative, so
the column is optimal and feasible.

Thus , the required solutions is X =125

Type A Board 1
2
X =125
2
Type B Board 4
Z = profit = 4375
Maximum Profit
4

An electric company produces three variables of ACSR conductors viz. weasel, rabbitand dog. The production
11 process requires two types of skilled labour for construction and finishing. The following table gives the available of
resources their uses by the three products and the profit per unit.
Resources requirement Daily
Resources per KM length availabilit
Weasel Rabbit Dog y
Raw
127 213 394 1000
material(kg)
Construction
5 7 10 50
(manhr)
Finishing
2 4 6 35
(man/hr)
Profit per unit
2000 3000 4000
(Rs)

Formulate the LP problem and determine the length of each variety to be manufactured per day to maximize the profit.
Solution:
Let X1=length of ACSR Weasel in Km.
X2=length of ACSR Rabbit in Km.
X3=length of ACSR Dog in Km.
Objective function
Maximize Subjected
Z =2000 X 1 + 3000 X 2 + 4000
to
127 X 1 +213 X 2 + 394 X31000
;
5 X 1 + 7 X 2 + 10 X 350 ;
2 X 1 + 4 X 2 +6
X 3 35 ; X 1 , X 2 , X
Standard Canonical Form Is

X1 , X2 , X 3 , S1 , S2 , S30
 5 X 1 + 7 X 2 + 10 X 3 + S2=500
2 X 1 + 4 X 2 +6 X 3 + S3= 35
e.v. X , X , X , S , S , S 0
1 2 3 1 2 3

Table I

Basis Z X1 X2 X3 S1 S2 S3 Solution Ratio

Z 1 -2000 -3000 -4000 0 0 0 0

L.V.
S1 0 127 213 394 1 0 0 1000 1000/394=2.
5 Smallest
S2 0 5 7 10 0 1 0 50 50/10=5
S3 0 2 4 6 0 0 1 35 35/6=5.8

e.v.
Table II
Basis Z X1 X2 X3 S1 S2 S3 Solution Ratio
Z 1 -710.66 -837.56 0 10.15 0 0 10152.28

L.V. X3 0 127/394 213/394 1 1/394 0 0 1000/394 4.69 smallest

S2 0 1.78 1.59 0 -0.03 1 0 24.62 15.45

S3 0 0.07 0.76 0 -0.02 0 1 19.77 26.14

e.v.
Table III
Basis Z X1 X2 X3 S1 S2 S3 Solution Ratio
Z 1 -211.27 0 1549.30 14.08 0 0 14084.51
L.V. X2 0 0.60 1 1.85 0.005 0 0 4.69 7.87
S2 0 0.83 0 -2.95 -0.03 1 0 17.14 20.74
S3 0 -0.38 0 -1.40 -0.02 0 1 16.22 -42.13
Table IV
Basis Z X1 X2 X3 S1 S2 S3 Solution Ratio
Z 1 0 354.33 2204.72 15.75 0 0 15748.03
X1 0 1 1.68 3.10 0.01 0 0 7.8740
S2 0 0 -1.39 -5.51 -0.04 1 0 10.63
S3 0 0 0.65 -0.20 -0.02 0 1 19.25

Since all the Z-row coefficient of non-basic variables are non-negative and all the RHS column are positive so
the solution is optimal and feasible.
Therefore the solutions is
Z =15748 .03
Weasel
X1=7 . 87
Rabbit
X2= 0
Dog
X3= 0
Check: =2000*7.87=15748

12 Z =2000 X 1 + 3000 X 2 + 4000

An electric motor manufacturing company produces two types of motors M1 and M2 each on a specific assembly line
L1 and L2 respectively. The daily capacities of the lines L1 and L2 are 600 and 750 motors respectively. Type M1 motor
uses 10 units of a certain electronic components and type M2 motor uses only 8 units. The supplier of the components
can provide 8000 pieces a day. The profits per motor of type M1 and type M2 are Rs 60 and Rs 40 respectively.
Formulate the LP problem and determine the number of each type of motors to be produced to maximize the profit.
Also find the maximum profit.
Solution:
Let X1 be the nos of M1 type of motor produced per day. X2
be the nos of M2 type of motor produced per day.
 Objectiove function Z- Maximize
Maximize
Z =60 X 1 + 40 X
Subjected to
2
10 X 1 + 8 X28000
X1600
X2750
X1 , X20

Standard Canonical for is

10 X 1 + 8 X 2 +
S1=8000
X1 +S2=600
X2 +S3=750
1 , X2 , S1 , S2 , S30
Xe.v.
Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 -60 -40 0 0 0 0
S1 0 10 8 1 0 0 8000 8000/10=80
L.V. S2 0 1 0 0 1 0 600 600/1=600
S3 0 0 1 0 0 1 750

e.v.
Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 0 -40 0 60 0 36000
L.V. S1 0 0 8 1 -10 0 2000 2000/8=250
X1 0 1 0 0 1 0 600
S3 0 0 1 0 0 1 750 750/1=750

Basis Z X1 X2 S1 S2 S3 Solution Ratio

Z 1 0 0 5 10 0 46000
X2 0 0 1 1/8 -5/4 0 250
X1 0 1 0 0 1 0 600
S3 0 0 0 -1/8 5/4 1 500
Since all the Z-coefficient of non-basic variables are nonnegative ands all the column are positive. The solution is optimal and
feasible.
Z=
46000
X1=600 , Check Z =60
X2=250
A small furniture factory manufacturing tables and chairs. It takes 2 hours to assemble a table and 30 minutes to
assemble a chair. Assembly is carried out by 4 workers on the basis of a single 8 hours shift a day. Customers usually
buy
13 at most 4 chairs with each table, meaning that the factory must provide at most 4 times as many chairs as tables. The
sale price is Rs 135 per table and Rs 50 per chair. Determine the daily production mix of chairs and tables that would
maximize the total daily revenue to the factory.

Solution:
Let X1= No. of tables.
X2= No. of Chairs.
Maximize
Z =135 X 1 + 50 X 2
 Z =135 X 1 + 50
Subjected to
1
2 X 1+ 2 X 2 32
X 2 4 X 1

Standard form
Maximize
Z =135 X 1 + 50
Subjected to
1
2 X 1 + 2 X 2+ S1=32
4 X 1+ X 2+ S2= 0

e.v.

Basis Z X1 X2 S1 S2 Solution Ratio

Z 1 -135 -50 0 0 0
L.V.
S1 0 2 1/2 1 0 32 32/2=16
S2 0 -4 1 0 1 0
e.v.

Basis Z X1 X2 S1 S2 Solution Ratio

Z 1 0 -65/4 135/2 0 2160
X1 0 1 1/4 1/2 0 16 64
L.V. S2 0 0 2 2 1 64 64/2=32

Basis Z X1 X2 S1 S2 Solution Ratio

Z 1 0 0 335/4 65/8 2680
X1 0 1 0 1/4 -0.125 8
X2 0 0 1 1 1/2 32
Since all the Z-row coefficient of non basic variables are non negative and RHS column are also non negative the solution is
optimum and feasible.
The required solution is Z =2680
X1=8
X2=32
Check:
Z =1358+5032
=1080+1600 =2680
A dealer wishes to purchase a number of table fans and ceiling fans. He has only Rs 5760 to invest and has space for
at most 20 items. A table fan costs him Rs 360 and a ceiling fan costs him Rs 240. His expectation is that he can sell a
table
14 fan at a profit of Rs 22 and a ceiling fan at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how
should he invest his money in order to maximize his profit?
Let X1= No. of tables.
X2= No. of Ceiling fans.
Maximize
Z =22 X1+18 X2
Subjected to
X 1 + X2 20
360 X 1 + 240 X25760
Standard form
 Maximize
Z =22 X1+18 X2
Subjected to
X 1 + X 2 +S1=20
360 X 1 + 240 X 2 +
e.v.
Basis Z X1 X2 S1 S2 Solution Ratio
Z 1 -22 -18 0 0 0
S1 0 1 1 1 0 20 20/1=20

L.V. S2 0 360 240 0 1 5760 5760/36

0=16

e.v.

Basis Z X1 X2 S1 S2 Solution Ratio

Z 1 0 -10/3 0 11/180 352
L.V. S1 0 0 1/3 1 -1/360 4 4*3=12
X1 0 1 2/3 0 1/360 16 16*3/2=
24

Basis Z X1 X1 S1 S1 Solution Ratio

Z 1 0 0 10 1/36 392
X2 0 0 1 3 -1/120 12
X1 0 1 0 -2 1/120 8
Since all the Z-row coefficient of non basic variables are non-negative & RHS column are also non-negative the
solution is optimum and feasible.
The required solution is
Z = 392
X1 = 8
X2 =12
Check:
Z =22 8
+1822
Z =176 +216
A contractor operates three material quarries for a dam. The material from each quarry is separated in to two grades.
15 The daily production capacities of the quarries as well as their daily operating costs are as follows:

Boulder Sand in Daily

stone in tons per operati
tons per day ng cost
day in
$1000
Quarry (Grade I (Grade per day
) II )
I 4 4 20
II 6 4 22
III 1 6 18
The contractor has committed himself to deliver 54 tons of boulder stone and 65 tons of sand in a week. Determine the
number of days each quarry should be operated during a week if the contractor has to fulfill his commitment at
minimum total cost. Assume that each quarry can be operated for fraction of day also.
Solution:
 Let X1 be the nos of days quary I is operated/week
X2 be the nos of days quary II is
operated/week X3 be the nos of days quary III
is operated/week
Minimize
Z =20 X 1 + 22 X 2 +18 X
Subjected to
4 X 1 + 6 X 2 + X354
4 X 1 + 4 X 2 +6 X
365
X17
X27
X37
1 , X2 , X 30
In CanonicalXform,
Minimize Z =20 X 1 + 22 X 2+18 X
Subjected to
4 X 16 X 2 X 3 + S1=54
4 X 14 X 2 6 X 3+ S2=65
X 1 +S3=7
X 2 +S4=7
X 3 +S5=7
X 1 , X 2 , X 3 , S 1 , S2 , S3 , S 4 , S 5
Now, the tabular form for Dual simplex method
e.v.

Basis Z X1 X2 X3 S1 S2 S3 S4 S5 Solution

Z 1 -20 -22 -18 0 0 0 0 0 0

S1 0 -4 -6 -1 1 0 0 0 0 -54
L.V.
S2 0 -4 -4 -6 0 1 0 0 0 -65
S3 0 1 0 0 0 0 1 0 0 7
S4 0 0 1 0 0 0 0 1 0 7
S5 0 0 0 1 0 0 0 0 1 7
Ratio 5 22/4 3
Smallest
e.v.

Basis Z X1 X2 X3 S1 S2 S3 S4 S5 Solution

Z 1 -8 -10 0 0 -3 0 0 0 195
L.V. S1 0 -10/3 -16/3 0 1 -1/6 0 0 0 -259/6
X3 0 2/3 2/3 1 0 -1/6 0 0 0 65/6
S3 0 1 0 0 0 0 1 0 0 7
S4 0 0 1 0 0 0 0 1 0 7
S5 0 -2/3 -2/3 0 0 1/6 0 0 1 -23/6
Ratio 12/5 15/8
e.v.

Basis Z X1 X2 X3 S1 S2 S3 S4 S5 Solution
Z 1 -7/4 0 0 -15/8 -43/16 0 0 0 4415/16
 X2 0 5/8 1 0 -3/16 1/32 0 0 0 259/32

X3 0 1/4 0 1 1/8 -1/48 0 0 0 87/16

S3 0 1 0 0 0 0 1 0 0 7
L.V. S4 0 -5/8 0 0 3/16 -1/32 0 1 0 -35/32
S5 0 -1/4 0 0 -1/8 3/16 0 0 1 25/16
Ratio 14/5

Basis Z X1 X2 X3 S1 S2 S3 S4 S5 Solution
Z 1 0 0 0 -12/5 -13/5 0 -14/5 0 279
X2 0 0 1 0 0 0 0 1 0 7
X3 0 0 0 1 1/5 -1/30 0 2/5 0 5
S3 0 0 0 0 3/10 -1/20 1 8/5 0 35/4
X1 0 1 0 0 -3/10 1/20 0 -8/5 0 7/4
S5 0 0 0 0 -1/20 1/5 0 -2/5 1 53/16
Since the Z-row coefficieint of non basic variables are non positive and all the values of RHS column are non
negative, the solution is optimum and feasible.
The solution is
Z =279
=7
X1
4
X2=7
X3=5
Check Z =20 7
+227+ 185
4
=35+154 +90
=279
A firm must produce 200kgs of a mixture consisting of the ingredients P and Q which cost Rs 3 and Rs 8 per
kg
16 respectively. Not more than 80 kgs of P can be used and at least 60 kgs of Q must be used. Find how much of
each ingredient should be used in order to minimize the cost.
Solution:
Let x1= Weight of ingredient P in kg.
x2= Weight of ingredient Q in
kg.
Minimize
Z =3 X 1 + 8 X
Subjected to X 1 + X 2 =200
X 1 80
X 2 60
X 1, X 2 0
2

Since given problem is not canonical form. So applying two phase simplex method to solve the problem.

Phase I
Introducing artificial variables R1,R2 and defining auxiliary objective function W.
Minimize
Z =3 X 1 + 8
Subjected
X to
2
X 1 + X 2 + R1=200
X 1 +S1 =80
X2 S2+ R2=60
Now, auxiliary objective function
W =R 1 + R 2
 W =R 1 +
R2
Minimize
W = R 1+ R 2
=X 12 X 2 + S2+260
Subjected to
X 1 + X 2 + R1=200
X1 +S1=80
X 2 S 2 + R2=60
e.v.

Basis W X1 X2 S1 S2 R1 R2 Solution Ratio

W 1 1 2 0 -1 0 0 260
S1 0 1 0 1 0 0 0 80
L.V. R1 0 1 1 0 0 1 0 200 200
R2 0 0
e.v. 1 0 -1 0 1 60 60

Basis W X1 X2 S1 S2 R1 R2 Solution Ratio

W 1 1 0 0 1 0 -2 140
L.V. S1 0 1 0 1 0 0 0 80 80
R1 0 1 0 0 1 1 -1 140 140/1=14
X2 0 0 1 0 -1 0 1 60

e.v.

Basis W X1 X2 S1 S2 R1 R2 Solution Ratio

W 1 0 0 -1 1 0 -2 60
X1 0 1 0 1 0 0 0 80
L.V. R1 0 0 0 -1 1 1 -1 60 60
X2 0 0 1 0 -1 0 1 60

Basis W X1 X2 S1 S2 R1 R2 Solution Ratio

W 1 0 0 0 0 -1 -1 0
X1 0 1 0 1 0 0 0 80
S2 0 0 0 -1 1 1 -1 60
X2 0 0 1 -1 0 1 0 120
Now, since the Z-row coefficients of non basic variables are non positive and all the values of RHS column are
non- negative, the solution is optimum and feasible.
Also W =0
- Phase II
Minimize Z =3 X 1 + 8 X 2
=3 ( 80 S1 )+8 (120+ S 1 )
5 S1+1200
Subjected to
X 1 +S 1 =80
S1+ S2=60
X 2 S1=120
Basis Z X1 X2 S1 S2 Solution Ratio
Z 1 0 0 -5 0 1200
X1 0 1 0 1 0 80
X2 0 0 1 -1 0 120
 Since the coefficient of non basic variable in objective function row are non-positive and all the values of RHS
column are positive. The solution is optimal and feasible.

The solution is
Z =1200
X1=80 kg
X2=120 kg
:
Z =5 S1+1200
=50+1200
=1200

There are four sources of energy generation options viz solar, micro hydro, bio-gas and fuel wood to supply
industrial,
17 lighting and cooking loads of a remote village. The cost of generation per GJ for solar, micro hydro, bio-gas
and fuel wood are Rs 3805, Rs 951, Rs 223 and 2.25 respectively. The energy requirement for various loads
are as follows:
Lighting : 398GJ
Cooking : 5025GJ
Industrial : 424GJ
Following are the limitations of each of the energy sources:
(i) Bio-gas can not be used for supplying industrial load.
(ii) Fuel wood can not be used for supplying industrial and lighting loads.
(iii) Micro hydro can be used for all kinds of loads.
(iv) Solar power can only be used for lighting loads and 8GJ of energy already being supplied is not to be
disturbed.
Formulate the LP problem to determine the amount of energy to be generated from each source to minimize the
total cost of generation.
Solution:
Let
x1=Solar energy generated in
x2=GJ Micro-hydro generated
x3= in GJ Bio-gas energy
x4=generated in GJ
Fuelwood energy generated in
GJ Minimize
Z =3805 X 1 + 951 X 2 + 223 X 3 + 2. 25 X 4
Subjected to X 1 + X2398
X 2 + X 3 + X 45025
X2424
X18
X 1 + X 2 + X 3 + X 4398+5025+ 424=5847
Using Dual si mplex method
Canonical form
Minimize
Z =3805 X 1 + 951 X 2 + 223 X 3 + 2. 25
Subjected
to X 1 X 2+ S1=398
X 2 X 3 X 4+ S2=5025
 X2+
S3=424
X1+ Shyam Kumar Yadav Roll No. :-2065/MSP/ 711

S4=8
X X X X +S =5847
 X 1 X 2+ S1=398
X 2 X 3 X 4+ S2=5025
X 2 + S3=424
X 1 + S4=8
X 1 X 2 X 3 X 4 +S5=5847
S2 , S3 , S 4 , S 5 0
X 1 , X 2 , X 3 , S 1 , e.v.

Basis Z X1 X2 X3 X4 S1 S2 S3 S4 S5 Solution
Z 1 -3805 -951 -223 -2.25 0 0 0 0 0 0
S1 0 -1 -1 -1 0 1 0 0 0 0 -398
S2 0 0 -1 -1 -1 0 1 0 0 0 -5025
S3 0 0 -1 0 0 0 0 1 0 0 -424
S4 0 -1 0 0 0 0 0 0 1 0 -8
L.V. S5 0 -1 -1 -1 -1 0 0 0 0 1 -5847
Ratio 3805 351 223 2.25
Smllest
e.v.

Basis Z X1 X2 X3 X4 S1 S2 S3 S4 S5 Solution
Z 1 15211 3795 883 0 0 0 0 0 -2.25 52623
4 4 4 4
S1 0 -1 -1 -1 0 1 0 0 0 0 -398
S2 0 1 0 0 0 0 1 0 0 0 822
L.V. S3 0 0 -1 0 0 0 0 1 0 0 -424
S4 0 -1 0 0 0 0 0 0 1 0 -8
X4 0 +1 +1 +1 1 0 0 0 0 1 5847
Ratio 3795
4
e.v.

Basis Z X1 X2 X3 X4 S1 S2 S3 S4 S5 Solution
Z 1 15211 0 883 0 0 0 3795 0 -2.25 1661703
4
4 4 4
S1 0 -1 0 -1 0 1 0 -1 0 0 26
S2 0 1 0 0 0 0 1 0 0 -1 822
X2 0 0 1 0 0 0 0 -1 0 0 424
L.V. S4 0 -1 0 0 0 0 0 0 1 0 -8
X4 0 1 0 1 1 0 0 1 0 -1 5423
Ratio 15211
4
Basis Z X1 X2 X3 X4 S1 S2 S3 S4 S5 Solution
Z 1 0 0 885 0 0 0 3795 15211 -2.25 1783391
4 4 4 4
S1 0 0 0 -1 0 1 1 0 -1 -1 34
S2 0 0 0 0 0 0 1 0 -1 -1 814
X2 0 0 1 0 0 0 0 -1 0 0 424
X1 0 1 0 0 0 0 0 0 -1 0 8

Shyam Kumar Yadav Roll No. :-2065/MSP/ 711

 X4 0 0 0 1 1 0 0 1 1 -1 5415
Ratio
Since the coefficient of no basic variable in objective function row are non positive and all the values of RHS column
are positive. The solution is optimal and feasible.
The solutions are Z =1783391
4
X1=8
X2= 424
X3= 0
X 4=5415

End of the Assignment No. 1, on Advanced Mathematics

Shyam Kumar Yadav Roll No. :-2065/MSP/ 711

 A contractor operates three material quarries for a dam. The material from each quarry is separated in to two grades. The daily
15
production capacities of the quarries as well as their daily operating costs are as follows:

Boulder Sand in Daily

stone in tons per operatin
tons per day g cost in
day $1000
Quarry (Grade I ) (Grade per day
II )
I 4 4 20
II 6 4 22
III 1 6 18
The contractor has committed himself to deliver 54 tons of boulder stone and 65 tons of sand in a week. Determine the number of
days each quarry should be operated during a week if the contractor has to fulfill his commitment at minimum total cost. Assume
that each quarry can be operated for fraction of day also.
Solution:
Let X1 be the nos of days quary I is operated/week
X2 be the nos of days quary II is
operated/week X3 be the nos of days quary III
is operated/week
Minimize
Z =20 X 1 + 22 X 2 +18
Subjected to
4 X 1+ 6 X 2 + X 3
54
4 X 1+ 4 X 2 +6 X 3
65
X 1 7
X 2 7
X 3 7
In Canonical form,
Minimize Z =20 X 1 + 22 X2 +18 X
Subjected 4 X 1 + 6 X 2 + X 3 S1 + R1=54
to 4 X 1 + 4 X 2+6 X 3 S2 + R2=65
X1 +S3=7
X 2 +S 4 = 7
X3 +S5=7
X1 , X2 , X 3
, S1 , S2 , S3 ,
S4 , S5 , R1 ,
R20
 4 X 1 + 6 X 2 + X 3 S1 + R1=54
4 X 1 + 4 X 2+6 X 3S 2+ R2=65
X1 +S3=7
X 2 +S 4 = 7
X3 +S5=7
X1 , X2 , X 3 , S1 , S2 , S3 , S4 , S5 , R1 , R20

Minimi
ze
W=R1+R2
= 54-( 4X1+ 6X2 +X3 -S1) + 65-(4X1 + 4X2 + 6X3 - S2)
= 119 - 8X1-10X2 - 7X3 + S1 + S2

Now, the tabular form for II Phase simplex method

e.v.
Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 8 10 7 0 0 1 1 0 0 0 119
R1 0 4 6 1 1 0 -1 0 0 0 0 54 9
L.V
. R2 0 4 4 6 0 1 0 -1 0 0 0 65 65/4
S3 0 1 0 0 0 0 0 0 1 0 0 7 0
S4 0 0 1 0 0 0 0 0 0 1 0 7 7
S5 0 0 0 1 0 0 0 0 0 0 1 7
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 8 0 7 0 0 1 1 0 -10 0 11
R1 0 4 0 1 1 0 -1 0 0 -6 0 12 3
R2 0 4 0 6 0 1 0 -1 0 -4 0 37 37/3
S3 0 1 0 0 0 0 0 0 1 0 0 7 7
X2 0 0 1 0 0 0 0 0 0 1 0 7
 L.V
. S5 0 0 0 1 0 0 0 0 0 0 1 7

e.v.
Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 0 5 -2 0 3 1 0 2 0 -13
X1 0 1 0 1/4 1/4 0 -1/4 0 0 -3/2 0 3 12
L.V. R2 0 0 0 5 -1 1 1 -1 0 2 0 25 5
S3 0 0 0 -1/4 -1/4 0 1/4 0 1 3/2 0 4
X2 0 0 1 0 0 0 0 0 0 1 0 7
S5 0 0 0 1 0 0 0 0 0 0 1 7 7
e.v.
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 0 0 -1 -1 2 2 0 0 0 -38
X1 0 1 0 0 3/10 -1/20 -3/10 1/20 0 -8/5 0 7/4 35
X3 0 0 0 1 -1/5 1/5 1/5 -1/5 0 2/5 0 5
S3 0 0 0 0 -3/10 1/20 3/10 -1/20 1 8/5 0 21/5
X2 0 0 1 0 0 0 0 0 0 1 0 7
L.V.
S5 0 0 0 0 1/5 -1/5 -1/5 1/5 0 -2/5 1 2 10
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 0 0 -3 1 4 0 0 4 -10 -58
X1 0 1 0 0 1/4 0 -1/4 0 0 -2/3 -1/4 5/4
X3 0 0 0 1 0 0 0 0 0 0 0 7
S3 0 0 0 0 -1/4 0 1/4 0 1 1/3 0 47/5
L.V.
X2 0 0 1 0 0 0 0 0 0 1 0 7
S2 0 0 0 0 1 -1 -1 1 0 -2 5 10
e.v.
e.v.
 Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 -4 0 -3 1 4 0 0 0 -10 -86
X1 0 1 2/3 0 1/4 0 -1/4 0 0 0 -1/4 71/12
X3 0 0 0 1 0 0 0 0 0 0 0 7
L.V.
S3 0 0 -0.333 0 -1/4 0 1/4 0 1 0 0 106/15
S4 0 0 1 0 0 0 0 0 0 1 0 7
S2 0 0 2 0 1 -1 -1 1 0 0 5 24
e.v.
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 4/3 0 1 1 0 0 -4 0 -10 -2986

X1 0 1 1/3 0 0 0 0 0 1 0 -1/4 779/60
X3 0 0 0 1 0 0 0 0 0 0 0 7
S3 0 0 -4/3 0 -1 0 1 0 1 0 0 424/15
L.V.
S4 0 0 1 0 0 0 0 0 0 1 0 7 7
S2 0 0 2 0 1 -1 -1 1 0 0 5 24 12
e.v.
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 0 0 1 1 0 0 -4 -4/3 -10 -8986/3

X1 0 1 0 0 0 0 0 0 1 -1/3 -1/4 639/60
X3 0 0 0 1 0 0 0 0 0 0 0 7
S3 0 0 0 0 -1 0 1 0 1 4/3 0 564/15
L.V. X2 0 0 1 0 0 0 0 0 0 1 0 7
S2 0 0 0 0 1 -1
e.v. -1 1 0 -2 5 10
e.v.

Basis Z X1 X2 X3 R1 R2 S1 S2 S3 S4 S5 Solution Ratio

W 1 0 0 0 0 2 1 -1 -4 -4/3 -10 -8986/3

X1 0 1 0 0 0 0 0 0 1 -1/3 -1/4 639/60
 X3 0 0 0 1 0 0 0 0 0 0 0 7
S3 0 0 0 0 0 -1 0 1 1 -2/3 5 714/15
X2 0 0 1 0 0 0 0 0 0 1 0 7
S2 0 0 0 0 1 -1 -1 1 0 -2 5 10
e.v.
Since the Z-row coefficieint of non basic variables are non positive and all the values of RHS column are non negative, the
solution should be optimum and feasible But objective function is not zero solution is not feasible.
The solution is
Z =279
=7
X1
4
X2=7
X3=5
Check Z =20 7
+227 + 185
4
=35+154 +90
=279