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
State the following problem in standard form

Q1

Maximize
Subject to

Z =2 X 1 X 2+5 X 3
X 1 2 X 2 +X 3 8
3 X 1 2 X 2 18

2 X 1 + X 2 2 X 3 4
X 1 , X 2 0, X 3

unrestricted in sign.

Solution:
Since
X 3 is unrestricted in sign, so it is expressed as difference of two non negative terms of
.
i.e;
X 3 = X '3 X ''3
'
Where
''

X3

X '3 X ''3

X 30

Standard form of the given L.P. problem is

Z =2 X 1 X 2 +5 ( X '3 X 3'' )

Z =2 X 1 X 2 +5 X '3 5 X ''3
Subjected to

X 1 2 X 2 +X '3 X ''3 +S 1 =8
3 X 1 +2 X 2S 2 =18
2 X 1 X 2 +2 X '3 2 X ''3 S 3=4
'

''

X 1 , X 2 , X 3 , X 3 , S 1 , S 2 , S3 0
2

Obtain the standard form of the following problem and express it in the canonical form.
Indicate the basic and non basic variables in the canonical form.
Maximize

Z =8 X 2 +3 X 3
Subject to
3 X 1 +2 X 2 + X 3 =6

7 X 2 +2 X 3 108
5 X 2 +4 X 335
X 1 , X 2 , X 3 0

How many basic solutions will this system have?

Solution:
Standard form of the given L.P. problem is
Maximize

Z =8 X 2 +3 X 3

Subjected to

3 X 1 +2 X 2 + X 3 =6
7 X 2 +2 X 3 +S 1=108
5 X 2 4 X 3 + S2 =35
X 1 , X 2 , X 3 ,S 1 , S2 0
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

X 1 , X 2 , X 3 ,S 1 , S2 0
Canonical form
Maximize

Z =8 X 2 +3 X 3

Subjected to

2
1
X 1 + X 2 + X 3 =2
3
3

7 X 2 +2 X 3 + S 1=108

5 X 2 4 X 3 +S2 =35

X 1 , X 2 , X 3 ,S 1 , S2 0
Here, Basic variables are
.
X 1 , S 1S 2
Non- basic variables are
.
X2 , X3
No. of basic solutions (n, m)

n
( nm ) ( m )

(5)
=10
( 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 X 1 2 X 2 +3 X 3 =11
4 X 1 +7 X 2 + X 3 =21
5 X 1 +8 X 2 +9 X 3 =48

Solution:
Performing pivotal operation on

a11

I
1
1
11
X 1 X 2 + X 3 = I 1 = o
3
2
6
6
25
41
0+ X 2 X 3 = II 1 =II o 4 I 1
3
3
29
13
233
0+ X 2 + X 3 = III 1 =III o 5 I 1
3
2
6
Again, Performing pivotal operation on a
22

23
119
1
X 3=
I 2 =II 2 + I 1
50
50
3
3
41
0+X 2 X 3 = II 2
25
25
383
1143
29
0+0+
X 3=
III 2 =III 1 II 2
50
50
3
X 1 +0+

Finally,
Performing, Pivotal operation on a33

23
III 3
50
3
0 X 1 + X 2 +0 X 3 =2 II 3 =II 2 + III 3
25
50
0 X 1 +0 X 2 + X 3 =3 III 3 =III 2
323
Hence, the solutions are
X 1 =1
X 2 =2
X 3 =3
X 1 +0 X 2 +0 X 3 =1 I 3 =I 2

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

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 X 2

Subject to

X 1 + X 2 1
2 X 1 + X 2 2
X 1 , X 2 0
Solution:Let us consider two given equations for plotting the graph.
The equations are

X 1+ X 2=1........................(i)
2 X 1 +X 2=2...........................(ii)

For equation (i),

X2
X1

X 1 + X 2 =1.
0
-1

1
0

2
1

3
2

For equation (ii),

X2
X1

2 X 1+ X 2 =2.

0
2
4
6
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
3 X 2 =4
4
or , X 2 = =1 .33
3


Putting the values of
in equation (i), we get
X
2

or,

4
X 1 + =1
3
4
X 1 =1
3
1
X 1 = =0 . 33
3

Now, from the graph,

At vertex A(0,0)

Z =2 X 1 +6 X 2 =20+60=0

At vertex B(1,0)

Z =2 X 1 +6 X 2 =21+ 60=2

At vertex C(0.33,1.33)

Z =2 X 1 + 6 X 2 =20 .33+ 61 . 33=8. 64

At vertex D(0,1)

Z =2 X 1 + 6 X 2 =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
X 1 =0 . 33
X 2 =1 . 33

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

Z =8 . 64
X 1 =0 . 33
X 2 =1 . 33
5. Use Simplex algorithm to determine the optimum feasible solution of the following LP problems:
(a)
Maximize

Z =5 X 1 +4 X 2

Subject to

6 X 1 +4 X 2 24
X 1 +2 X 2 6
X 1 + X 2 1
X 2 2
X 1 , X 2 0
Solution:Standard form of Linear programming is
Maximize

Z =5 X 1 +4 X 2

Subject to

6 X 1 +4 X 2 + S 1=24
X 1 +2 X 2 + S 2 =6

X 1 + X 2 +S 3 =1
X 2 +S 4 =2
X 1 , X 2 , S1 , S 2 , S 3 , S 4 0

e.v.

Table I

L.V.

Basis

X1

X2

S1

S2

S3

S4

Solution

Ratio

Z
S1
S2

1
0
0

-5
6
1

-4
4
2

0
1
0

0
0
1

0
0
0

0
0
0

0
24
6

4
6

S3
S4

0
0

-1
0

1
1

0
0

0
0

1
0

0
1

1
2

-1
-

S1

S2

S3

S4

Solution

Ratio

0
0
1
0
0

0
0
0
1
0

0
0
0
0
1

20
4
2
5
2

6
3/2
3
2

S1

S2

S3

S4

Solution

Ratio

0
0
0
1
0

0
0
0
0
1

21
3
1.5
2.5
0.5

e.v.

Table II
Basis

L.V.

Smallest

X1

Z
X1
S2
S3
S4

1
0
0
0
0

0
1
0
0
0

Basis

X1

X2
5

2
3

2
4
5

3
3

6
1
6

smallest

Table III
Z
X1
X2
S3
S4

1
0
0
0
0

0
1
0
0
0

X2
0
0
1
0
0

0.25
1
8
3
8
1

-0.5
5
4
5
4
3

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 2

Subject to

X 1 +2 X 2 5
X 1 +X 2 4
X 1 , X 2 0

Standard Canonical Form

Maximize

Z =2 X 1 +4 X 2

Subject to

X 1 +2 X 2 + S 1=5
X 1 + X 2 +S 2 =4

X 1 , X 2 , S1 , S 2 0

L.V.

e.
Table I v.
X1
X2

S1

S2

Solution

-4
2
1

0
1
0

0
0
1

2.5
4

X1

X2

S1

S2

Solution

Ratio

0
0.5
0.5

0
1
0

2
0.5
-0.5

0
0
1

10
2.5
1.5

Basis

Z
S1
S2

1
0
0

-2
1
1

Basis
Z
X2
S2

Z
1
0
0

Ratio
smallest

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 variableX 1 is zero. Hence the given L.P. problems have infinite number of
solutions.
(c)

Minimize

Subject to

Z =3 X 12 X 2
X 1 X 2 1
3 X 1 2 X 2 6

X 1 , X 2 0
Solution:The standard form of given linear programming is
Minimize

Z +3 X 1 +2 X 2 =0

Subjected to

X 1 X 2 +S 1=1
3 X 1 2 X 2 +S 2 =6
X 1 , X 2 , S1 , S 20

Tabular form

e.v.

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

e.v.

L.V.

Table I
Basis

X1

X2

S1

S2

Solution

Z
S1

1
0

3
1

2
-1

0
1

0
0

0
1

S2

-2

Table II
Basis
Z

L.V.

Z
X1

1
0

Ratio
smallest

e.v.
X1

X2

S1

S2

Solution

Ratio

0
1

5
-1

-3
1

0
0

-3
1

-1

S2
0
0
1
-3
1
3
3
smallest
Table III
Solution Ratio
X1
X2
S1
S2
Basis
Z
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. Usealltwo phase simplex method to solve the following LP problem
Minimize
Z =3 X 1+2 X 2
Subject to

3 X 1 + X 2 3

4 X 1 +3 X 2 6

X 1 +2 X 2 4
X 1 , X 2 0
Solution:
Standard form of Linear programming is
Minimize

Subject to

Z =3 X 1 +2 X 2

3 X 1 + X 2 S1 =3
4 X 1+3 X 2 S 2=6
X 1 + X 2 +S 3 =3
X 1 , X 2 , S1 , S 2 , S 3 0
Since these equations do not give initial basic solutions, Let us introduce the artificial variablesR R .
1
2
To Get that,
Minimize
Z =3 X 1+2 X 2
Subjected to

3 X 1 + X 2 S1 +R1 =3

4 X 1 +3 X 2 S 2 +R 2 =6
X 1 +X 2 +S 3 =3
X 1 , X 2 , S1 , S 2 , R 1 , R2 0
Defining auxialiary objective function W
Minimize

W=R 1 +R 2

Substituting values of R1 & R2

W

=33 X 1 X 2+S 1+64 X 1 3 X 2+S2

=7 X 14 X 2 +S1 +S 2 +9
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

=7 X 14 X 2 +S1 +S 2 +9
Subjected to

3 X 1 + X 2 S1 +R1 =3
4 X 1 +3 X 2 S 2 +R 2 =6
X 1 +X 2 +S 3 =3
X 1 , X 2 , S1 , S 2 , R 1 , R2 0
e.v.

Table I

X1

Basis W
L.V.

X2

S1

S2

S3

R1

R2

Solution Ratio

W
R1
R2

1
0

7
3

4
1

-1
-1

-1
0

0
0

0
1

0
0

9
3

-1

3/2

S3

Smallest

e.v.
X1

Basis W

L.V.

X2

S1

S2

S3

R1

R2

Solution Ratio

W
X1
R2
S3

1
0
0
0

0
1
0
0

5/3
1/3
5/3
2/3

4/3
-1/3
4/3
1/3

-1
0
-1
0

0
0
0
1

-7/3
1/3
-4/3
-1/3

0
0
1
0

Basis

X1

X2

S1

S2

S3

R1

R2

2
1
2
2

3
6/5
3

Smallest

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 R1 & 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
3 3
1

(5 + 5 S 5 S )
6
4
3
X =( S + S )
5
5
5
Z =3 X + 2 X
X 1=

Minimize

3 3
1
6 4
3
=3 + S1 S2 +2 S1 + S 2
5 5
5
5 5
5
21/ 5+1/ 5 S 1 +3 /5 S2

Subjected to

In tabular form,
Basis Z
X1

) (

3
1
3
X 1 S1 + S 2 =
5
5
5
4
3
6
X 2 + S 1 S 2=
5
5
5
1
2
6
S 1 + S2 + S 3 =
5
5
5

X2

S1

S2

S3

Solution

Shyam Kumar Yadav

Ratio
Roll No. :-2065/MSP/ 711

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:

X 1=

3
5

X 2=

Check: Z =3 X + 2 X =33 + 26 =21

1
2
5

Z=

21
5

Solve the following LP problem by Dual simplex method:

Minimize

Z =4 X 1 + X 2

Subject to

3 X 1 + X 2 =3
4 X 1 +3 X 2 6
X 1 +2 X 2 4
X 1 , X 2 0
Solution:Standard form of the above problem is
Minimize

Z =4 X 1 + X 2

Subject to

3 X 1 + X 2 3
3 X 1 + X 2 3
4 X 1 +3 X 2 6
X 1 +2 X 2 4
X 1 , X 2 0
Now, the standard form of L.P. is
Minimise
Z =4 X 1 + X 2
Subjected to

3 X 1 + X 2 + S 1 =3
3 X 1 X 2 +S 2 =3
4 X 1 3 X 2 + S 3 =6
X 1 +2 X 2 + S 4 =4

X 1 , X 2 , S1 , S 2 , S 3 , S 4 0
e.v.

L.V.

Basis

X1

X2

S1

S2

S3

S4

Solution

Z
S1
S2
S3
S4
Ratio

1
0
0
0
0

-4
3
-3
-4
1

-1
1
-1
-3
2

0
1
0
0
0

0
0
1
0
0

0
0
0
1
0

0
0
0
0
1

0
3
-3
-6
4

1 1/3

Minmum

e.v.

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

L.V.

Basis

X1

X2

S1

S2

S3

S4

Solution

Z
S1
S2

1
0

-8/3
5/3

0
0

0
1

0
0

-1/3
1/3

0
0

2
1

-5/3

-1/3

-1

X2
S4
Ratio

0
0

4/3
-5/3

1
0

0
0

0
0

-1/3
2/3

0
1

2
0

8/5

Minmum

e.v.

L.V.

Basis
Z
S1
S3

Z
1
0
0

X1

X2

S1

S2

S3

S4

-1
0
5

0
0
0

0
1
0

-1
1
-3

0
0
1

0
0
0

Solution
3
0
3

X2
S4
Ratio

0
0

3
-5

1
0

0
0

-1
2

0
0

0
1

3
-2

Basis
Z
S1
S3
X2
X1

Z
1
0
0

X1
0
0
0

X2
0
0
0

S1
0
1
0

S2
-7/5
1
-1

S3
0
0
1

S4
-1/5
0
1

Solution
17/5
0
1

0
0

0
1

1
0

0
0

1/5
-2/5

0
0

3/5
-1/5

9/5
2/5

1/5

Ratio

Minmum

Ratio

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

( 25 )+ 95 = 85 + 95 =175

Z =4 X 1 + X 2 =4
8. Consider the following LP problem
MaximizeZ =6 X +7 X +3 X +5 X
1
2
3
4
Subject to

5 X 1 + 6 X 2 3 X 3 + 4 X 4 12
X 2 + 5 X 3 + 6 X 4 10
2 X 1 +5 X 2 + X 3 + X 4 8

X 1 , X 2 , X 3 , X 4 0

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,
MinimizeZ =6 X 1 +7 X 2 +3 X 3 +5 X 4
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

Z =6 X 1 +7 X 2 +3 X 3 +5 X 4
Subjected to 5 X 6 X +3 X 4 X + S =12
1
2
3
4
1
X 2 + 5 X 3 + 6 X 4 + S2 =10
2 X 1 5 X 2 X 3 X 4 + S3 =8
X 1 , X 2 , X 3 , X 4 , S1 , S 2 , S 3 0
Basis

X1

X2

X3

X4

S1

S2

S3

Solution

Z
S1
S2
S3

1
0
0
0

-6
-5
0
-2

-7
-6
-1
-5

-3
3
5
-1

-5
-4
6
-1

0
1
0
0

0
0
1
0

0
0
0
1

0
-12
-10
-8

Ratio

(ii) Two Phase Simplex method:

Phase I:
Minimize
Z =6 X 1 +7 X 2 +3 X 3 +5 X 4
Subjected to

5 X 1 + 6 X 2 3 X 3 + 4 X 4 S1 + R 1 =12
X 2 5 X 3 6 X 4 S2 + R 2 =10
2 X 1 +5 X 2 + X 3 + X 4 S 3 + R 3=8
X 1 , X 2 , X 3 , X 4 , S1 , S 2 , S 3 , R1 , R 2 , R 3 0

Let W= auxiliary objective function.

Minimize

W =R 1 + R 2 + R3 =7 X 112 X 2 +7 X 3 + X 4 +S 1 + S 2 + S3 + 30

Subjected to

5 X 1 + 6 X 2 3 X 3 + 4 X 4 S1 + R 1 =12
X 2 5 X 3 6 X 4 S2 + R 2 =10
2 X 1 +5 X 2 + X 3 + X 4 S 3 + R 3= 8
e.v.

L.V.

Basis

X1

X2

X3

X4

R1

R2

R3

S1

S2

S3

W
R1
R2
R3

1
0
0
0

7
5
0
2

12
6
1
5

-7
-3
-5
1

-1
4
-6
1

0
1
0
0

0
0
1
0

0
0
0
1

-1
-1
0
0

-1
0
-1
0

-1
0
0
-1

Solutio Ratio
n
30
12
10
8

2
10
8/5

e.v.

L.V.

Basis

X1

X2

X3

X4

R1

R2

R3

S1

S2

S3

Solutio Ratio
n
54/5

W
R1
R2
X2

11/5

-47/5

-17/5

-12/5

-1

-1

7/5

13/5

-21/5

14/5

-6/5

-1

6/5

12/5

-2/5

-26/5

-31/5

-1/5

-1

1/5

42/5

2/5

1/5

1/5

1/5

-1/5

8/5

12/13
4

e.v.

L.V.

Basi

X1

X2

X3

X4

R1

R2

R3

S1

S2

S3

Solutio Ratio
n
114/13

-76/13

-75/13

-11/13

-18/13

-2/13

-1

5/13

X1
R2
X2

-21/13

14/13

5/13

-6/13

-5/13

6/13

12/13

-76/13

-75/13

2/13

-5/13

-2/13

-1

5/13

114/13

114/5

11/13

-3/13

-2/13

5/13

2/13

-5/13

16/13

-16/5

e.v.

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

L.V.

Basis

X1

X2

X3

X4

R1

R2

R3

S1

S2

S3

Solutio Ratio
n

-5/6

-9/2

-20/3

-7/6

-1

1/6

-1

S3

13/6

-7/2

7/3

5/6

-1

-5/6

R2
X2

-5/6

-9/2

-20/3

-1/6

1/6

-1

5/6

-1/2

2/3

1/6

-1/6

Basis

X1

X2

X3

X4

R1

R2

R3

S1

S2

S3

W
S3

1
0

0
-2

0
0

0
-26

0
-31

-1
0

-1
5

-1
-1

0
0

0
-5

0
1

S1
X2

0
0

-5
0

0
1

-27
-5

-40
-6

-1
0

6
1

0
0

1
0

-6
-1

0
0

48

Solutio Ratio
n0
42
48
10

Now the W. row coefficient of non-linear basic variable R1 , 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
Z =6 X 1 +7 X 2 +3 X 3 +5 X 4

Minimize

=6 X 1 +7 ( 10+ 5 X 3 + 6 X 4 + S2 ) +3 X 3 +5 X 4

Z =6 X 1 +38 X 3 +47 X 4 +7 S 2 +70

Subjected to

2 X 1 26 X 3 31 X 4 5 S 2 + S 3 =42
5 X 1 27 X 3 40 X 4 + S1 6 S 2=48
X 2 5 X 3 6 X 4 S 2 =10

Basis

X1

X2

X3

X4

S1

S2

S3

Solution

Z
X2
S1
S3

1
0
0
0

-6
0
-5
-2

0
1
0
0

-38
-5
-27
-26

-47
-6
-40
-31

0
0
-1
0

-7
-1
-6
-5

0
0
0
1

70
10
48
42

Ratio

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

X 1 =0
X 2 =10
X 3 =0
X 4 =0
Z =70
9)

Write the dual of the following LP problem:

Maximize

Z =70 X 1 + 110 X 2
Subject to

3 X 1 + 5 X 2 800
4 X 1 + 6 X 2 900

5 X 1 + 8 X 2 1200
X 2 300
X 1 , X 2 0

Solution:Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

The dual form of the given LP problem is

Minimize
Subjected to

V =800 y 1 + 900 y 2 +1200 y 3 +300 y 4

3 y 1 +4 y 2 +5 y 3 70
5 y 1 +6 y 2 + 8 y3 + y 4 110
y 1 , y 2 , y 3 , y 4 0

10

Two types of printed circuit boards A and B are to be produced in a computer manufacturing company. The 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
Component
t
Soldering
inspection
Board placement
A
16
10
B
10
12

4
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 X 2

Subjected to

16 X 1 +10 X 2 1500
10 X 1 + 12 X 2 1000
4 X 1 + 8 X 2 500
X 1 , X 2 0
Standard form of the linear programming problem is
Maximize
Z =10 X 1 + 15 X 2
Subjected to

L.V.

Basis
Z
S1
S2
S3

Z
1
0
0
0

16 X 1 +10 X 2 + S 1= 1500
10 X 1 + 12 X 2 + S2 =1000
4 X 1 + 8 X 2 + S 3 =500
X 1 , X 2 , S1 , S 2 , S 3 0
e.v.

X1

X2

S1

S2

S3

Solution

-10
16
10
4

-15
10
12
8

0
1
0
0

0
0
1
0

0
0
0
1

0
1500
1000
500

S3

Solution

Ratio

150
1000/12
500/8 Smallest

e.v.

L.V.

Basis

X1

X2

S1

S2

Z
S1
S2

1
0
0

-5/2
11
4

0
0
0

0
1
0

0
0
1

15/8 1875/2
-5/4
875
-3/2
250
Shyam Kumar Yadav

Ratio

875/11
250/4

Smallest
Roll No. :-2065/MSP/ 711

L.V.

X2

1/2

1/8

125/2

125

Basis

X1

X2

S1

S2

S3

Solution

Ratio

Z
S1
X1

1
0

0
0

0
0

0
1

5/8

15/16

4375/4

-11/4

61/8

375/2

0
0

1
0

0
1

0
0

1/4

-3/8

125/2

-1/8

5/16

125/4

X2

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 1=

Type A Board

X 2=

Type B Board

2
125
4

Z = profit =

Maximum Profit

11

125

4375
4

An electric company produces three variables of ACSR conductors viz. weasel, rabbitand dog. The production
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

Resources requirement
per KM length
Weasel Rabbit Dog

Daily
availabilit
y

Raw
material(kg)

127

213

394

1000

Construction
(manhr)

10

50

Finishing
(man/hr)

35

2000

3000

4000

Profit per unit

(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 to

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

127 X 1 +213 X 2 + 394 X 3 1000 ;
5 X 1 + 7 X 2 + 10 X 3 50 ;
2 X 1 + 4 X 2 +6 X 3 35 ;
X 1 , X 2 , X 3 0 ;

Standard Canonical Form Is

127 X 1 +213 X 2 + 394 X 3 + S1 =100

5 X 1 + 7 X 2 + 10 X 3 + S 2=500
2 X 1 + 4 X 2 +6 X 3 + S3 = 35
X 1 , X 2 , X 3 , S 1 , S2 , S3 0
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

e.v.

Table I
Z

X1

X2

X3

S1

S2

S3

Solution

Ratio

-2000

-3000

-4000

S1

127

213

394

1000

1000/394=2.
5

S2

10

50

50/10=5

S3

35

35/6=5.8

X2

X3

S1

S2

S3

Solution

Ratio

Z
X3

-710.66

-837.56

10.15

10152.28

127/394

213/394

1/394

1000/394

4.69

S2
S3

1.78

1.59

-0.03

24.62

15.45

0.07

0.76

-0.02

19.77

26.14

X1

X2

X3

S1

S2

S3

Solution

Ratio

Table III
Basis
Z
1

-211.27

1549.30

14.08

14084.51

0.60

1.85

0.005

4.69

7.87

0.83

-2.95

-0.03

17.14

20.74

S3

-0.38

-1.40

-0.02

16.22

-42.13

Table IV
X1
Basis
Z
1
0
Z
0
1
X1
0
0
S2
0

smallest

e.v.

Z
X2
S2

S3

Smallest

e.v.

Table II
Basis
Z
X1

L.V.

Basis
L.V.

L.V.

5 X 1 + 7 X 2 + 10 X 3 + S 2=500
2 X 1 + 4 X 2 +6 X 3 + S3 = 35
X 1 , X 2 , X 3 , S 1 , S2 , S3 0

X2

X3

354.33 2204.72

S1

S2

S3

Solution

15.75

15748.03

1.68

3.10

0.01

7.8740

-1.39

-5.51

-0.04

10.63

0.65

-0.20

-0.02

19.25

Ratio

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
Weasel
Rabbit
Dog

Check:
12

Z =15748 .03
X 1 =7 . 87
X 2= 0
X 3= 0

Z =2000 X 1 + 3000 X 2 + 4000 X 3 =2000*7.87=15748

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.
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

Objectiove function Z- Maximize

Maximize

Z =60 X 1 + 40 X 2

Subjected to

10 X 1 +8 X 2 8000
X 1 600
X 2 750
X 1 , X 2 0
Standard Canonical for is

10 X 1 + 8 X 2 + S 1 =8000
X 1 +S 2 =600
X 2 +S 3 =750
X 1 , X 2 , S1 , S 2 , S 3 0
e.v.

L.V.

Basis

X1

X2

S1

S2

S3

Solution

Ratio

Z
S1
S2
S3

1
0
0
0

-60
10
1
0

-40
8
0
1

0
1
0
0

0
0
1
0

0
0
0
1

0
8000
600
750

8000/10=80
0
600/1=600

e.v.
X1

Basis Z
L.V.

X2

S1

S2

S3

Solution Ratio

Z
S1

1
0

0
0

-40
8

0
1

60
-10

0
0

36000
2000 2000/8=250

X1

600

S3

750

Basis
Z
X2

Z
1
0

X1

X2

S1

S2

S3

Solution

0
0

0
1

5
1/8

10
-5/4

0
0

46000
250

X1
S3

0
0

1
0

0
0

0
-1/8

1
5/4

0
1

600
500

750/1=750

Ratio

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
X 1 =600 ,
X 2 =250

13

Check

Z =60 600+40250=46000

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
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

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

Z =135 X 1 + 50 X 2

Subjected to

2 X 1+

X 32
2 2
X 2 4 X 1

Standard form
Maximize

Z =135 X 1 + 50 X 2

Subjected to

2 X 1+

X + S1 =32
2 2
4 X 1 + X 2 + S2 = 0

e.v.

L.V.

Basis

X1

X2

S1

S2

Solution

Ratio

Z
S1

1
0

-135
2

-50
1/2

0
1

0
0

0
32

32/2=16

S2

-4

S1

S2

Solution

0
0
1

2160
16
64
64/2=32
64

e.v.

L.V.

Basis
Z
X1
S2

Z
1
0
0

X1

X2

Basis

X1

X2

S1

S2

Solution

Z
X1
X2

1
0
0

0
1
0

0
0
1

335/4
1/4
1

65/8
-0.125
1/2

2680
8
32

0
1
0

-65/4 135/2
1/4
1/2
2
2

Ratio

Ratio

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.

Z =2680
X 1 =8
X 2 =32

The required solution is

Check:

Z =135 8+50 32
=1080+1600 =2680

14

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
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 X 1 +18 X 2

Subjected to

Standard form

X 1 + X 2 20
360 X 1 + 240 X 2 5760

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

Maximize

Z =22 X 1 +18 X 2

Subjected to

X 1 + X 2 +S 1 =20
360 X 1 + 240 X 2 + S 2 =5760
e.v.

L.V.

Basis

X1

X2

S1

S2

Solution

Z
S1
S2

1
0
0

-22
1
360

-18
1
240

0
1
0

0
0
1

0
20 20/1=20
5760 5760/36

Ratio

0=16

e.v.

L.V.

Basis

X1

X2

S1

S2

Solution

Ratio

Z
S1
X1

1
0
0

0
0
1

-10/3
1/3
2/3

0
1
0

11/180
-1/360
1/360

352
4
16

4*3=12

Basis
Z
X2
X1

Z
1
0
0

X1

X1

S1

S1

Solution

0
0
1

0
1
0

10
3
-2

1/36
-1/120
1/120

392
12
8

16*3/2=
24

Ratio

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
Z =392
15

A contractor operates three material quarries for a dam. The material from each quarry is separated in to two grades.
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:
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

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 3

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
X 1 , X 2 , X 3 0

In Canonical form,
Minimize
Z =20 X 1 + 22 X 2 +18 X 3
Subjected to

4 X 1 6 X 2 X 3 + S 1=54
4 X 1 4 X 2 6 X 3 + S2 =65
X 1 +S 3 =7
X 2 +S 4 =7
X 3 +S 5 =7
X 1 , X 2 , X 3 , S 1 , S2 , S3 , S 4 , S5 0
Now, the tabular form for Dual simplex method
e.v.

L.V.

Basis

X1

X2

X3

S1

S2

S3

S4

S5

Solution

Z
S1
S2
S3

1
0
0
0
0
0

-20
-4
-4
1
0
0
5

-22
-6
-4
0
1
0
22/4

-18
-1
-6
0
0
1
3

0
1
0
0
0
0

0
0
1
0
0
0

0
0
0
1
0
0

0
0
0
0
1
0

0
0
0
0
0
1

0
-54
-65
7
7
7

X3

S1

S2

S3

S4

S5

Solution

0
0
1
0
0
0

0
1
0
0
0
0

-3
-1/6
-1/6
0
0
1/6

0
0
0
1
0
0

0
0
0
0
1
0

0
0
0
0
0
1

195

S4
S5
Ratio

e.v.

L.V.

Basis

Z
S1
X3
S3
S4
S5

1
0
0
0
0
0

Ratio

X1

X2

-8
-10
-10/3 -16/3
2/3
2/3
1
0
0
1
-2/3 -2/3
12/5 15/8

Smallest

-259/6

65/6
7
7
-23/6

e.v.

Basis
Z

Z
1

X1

X2

X3

S1

S2

S3

S4

S5

Solution

-7/4

-15/8

-43/16

4415/16

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

L.V.

X2

5/8

-3/16

1/32

259/32

X3

0
0

1/4

1/8

-1/48

87/16

-5/8

3/16

-1/32

-35/32

-1/4

-1/8

3/16

25/16

S3
S4
S5
Ratio

14/5

Basis

X1

X2

X3

S1

S2

S3

S4

S5

Solution

Z
X2
X3
S3
X1
S5

1
0
0
0
0
0

0
0
0
0
1
0

0
1
0
0
0
0

0
0
1
0
0
0

-12/5
0
1/5
3/10
-3/10
-1/20

-13/5
0
-1/30
-1/20
1/20
1/5

0
0
0
1
0
0

-14/5
1
2/5
8/5
-8/5
-2/5

0
0
0
0
0
1

279
7
5
35/4
7/4
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
X 1=
4
X 2 =7
X 3 =5

Check

Z=

20 7
4

+227+ 185

=35+154 +90
=279
16

A firm must produce 200kgs of a mixture consisting of the ingredients P and Q which cost Rs 3 and Rs 8 per kg
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:
x 1= Weight of ingredient P in kg.
Let
x 2= Weight of ingredient Q in kg.
Minimize
Z =3 X + 8 X
1

Subjected to

X 1 + X 2 =200
X 1 80
X 2 60
X1 , X2 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 X 2

Subjected to

X 1 + X 2 + R1 =200
X 1 +S 1 =80
X 2 S 2 + R2 =60

Now, auxiliary objective function

W =R 1 + R 2
Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

W =R 1 + R 2

Minimize

W = R 1+ R 2

= X 12 X 2 + S 2 +260

Subjected to

X 1 + X 2 + R1 =200
X 1 +S 1 =80
X 2 S 2 + R2 =60
e.v.

Basis

X1

X2

S1

S2

R1

R2

Solution

Ratio

W
S1
R1

1
0
0

1
1
1

2
0
1

0
1
0

-1
0
0

0
0
1

0
0
0

260
80
200

200

R2

-1

60

60

L.V.

e.v.

L.V.

Basis W

X1

X2

S1

S2

R1

R2

Solution

W
S1
R1

1
0
0

1
1
1

0
0
0

0
1
0

1
0
1

0
0
1

-2
0
-1

140
80
140

X2

-1

60

Ratio
80
140/1=14
0

e.v.

L.V.

Basis W

X1

X2

S1

S2

R1

R2

Solution

W
X1
R1
X2

0
1
0
0

0
0
0
1

-1
1
-1
0

1
0
1
-1

0
0
1
0

-2
0
-1
1

60
80
60
60

Basis W

X1

X2

S1

S2

R1

R2

Solution

-1

-1

X1

80

S2

-1

-1

60

X2

-1

120

1
0
0
0

Ratio

60

Ratio

Now, since the Z-row coefficients of non basic variables are non positive and all the values of RHS column are nonnegative, the solution is optimum and feasible.
W =0
Also
- Phase II
Minimize
Z =3 X 1 + 8 X 2
=3 ( 80 S1 ) +8 ( 120+ S 1 )
5 S 1 +1200

Subjected to

X 1 +S 1 =80
S 1 + S2 =60
X 2 S1 =120

Basis Z

X1

X2

S1

S2

Solution

Z
X1

0
1

0
0

-5
1

0
0

1200
80

1
0

Ratio

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

X2

-1

120

S2

0
0
0
-1
1
60
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
X 1 =80 kg
X 2 =120
kg
Check
:

Z =5 S 1 +1200
=50+1200
=1200

17

There are four sources of energy generation options viz solar, micro hydro, bio-gas and fuel wood to supply industrial,
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
x 1= Solar energy generated in GJ
x 2= Micro-hydro generated in GJ
x 3= Bio-gas energy generated in GJ
x 4 = Fuelwood energy generated in GJ
Minimize

Z =3805 X 1 + 951 X 2 + 223 X 3 + 2. 25 X 4

Subjected to

X 1 + X 2 398
X 2 + X 3 + X 4 5025
X 2 424
X 1 8
X 1 + X 2 + X 3 + X 4 398+5025+ 424=5847

Using Dual simplex method

Canonical form
Minimize

Z =3805 X 1 + 951 X 2 + 223 X 3 + 2. 25 X 4

Subjected to

X 1 X 2 + S1 =398
X 2 X 3 X 4 + S 2=5025
X 2 + S 3 =424
Shyam Kumar Yadav
X 1 + S 4 =8
X X X X +S =5847

Roll No. :-2065/MSP/ 711

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

L.V.

Basis

X1

X2

X3

X4

S1

S2

S3

S4

S5

Solution

Z
S1
S2

1
0

-3805
-1

-951
-1

-223
-1

-2.25
0

0
1

0
0

0
0

0
0

0
0

0
-398

-1

-1

-1

-5025

S3
S4

0
0

0
-1

-1
0

0
0

0
0

0
0

0
0

1
0

0
1

0
0

-424
-8

S5

-1

-1

-1

-1

-5847

3805

351

223

2.25

Ratio

Smllest
e.v.
Basis Z
Z 1

L.V.

S1
S2
S3
S4
X4

0
0
0
0
0

X1
X2
X3
X4
15211 3795 883 0
4
4
4

S1

S2

S3

S4

S5

-2.25

-1
1
0
-1
+1

-1
0
-1
0
+1

Ratio

Solution
52623
4

-1
0
0
0
+1

0
0
0
0
1

1
0
0
0
0

0
1
0
0
0

0
0
1
0
0

0
0
0
1
0

0
0
0
0
1

-398
822
-424
-8

X3

X4

S1

S2

S3

S4

S5

Solution

5847

3795
4

e.v.
X1

Basis Z

L.V.

X2

15211 0
4

883 0
4

3795 0
4

-2.25

1661703
4

S1
S2
X2
S4
X4

0
0
0
0
0

-1
1
0
-1
1

-1
0
0
0
1

1
0
0
0
0

0
1
0
0
0

-1
0
-1
0
1

0
-1
0
0
-1

26
822
424
-8
5423

0
0
1
0
0

0
0
0
0
1

15211
4

Ratio
Basis

X1

X2

X3

X4

S1

S2

885
4
-1
0
0

S1
S2
X2

0
0
0
1
0

0
0
0

0
0
0

0
0
1

0
0
0

1
0
0

1
1
0

Shyam Kumar Yadav

S3

S4

3795 15211
4
4
0
0
-1

-1
-1
0

S5

Solution

-2.25 1783391

4
-1
-1
0

34
814
424

Roll No. :-2065/MSP/ 711

X1

-1

X4

-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
1783391
Z=
4
X 1 =8
X 2 = 424
X 3= 0
X 4 =5415
End of the Assignment No. 1, on Advanced Mathematics

Shyam Kumar Yadav

Roll No. :-2065/MSP/ 711

15

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

Sand in Daily
tons per operatin
day
g cost in
$1000

Quarry

(Grade I )

(Grade
II )

per day

I
II
III

4
6
1

4
4
6

20
22
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
Subjected to

Z =20 X 1 + 22 X 2 +18 X 3
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
X 1 , X 2 , X 3 0

In Canonical form,
Minimize
Z =20 X 1 + 22 X 2 +18 X 3
Subjected to

4 X 1 + 6 X 2 + X 3 S1 +R1 =54
4 X 1 + 4 X 2 +6 X 3 S 2 + R 2 =65
X 1 +S 3 =7
X 2 +S 4 =7
X 3 +S 5 =7
X 1 , X 2 , X 3 , S 1 , S2 , S3 , S 4 , S 5 , R1 , R2 0

4 X 1 + 6 X 2 + X 3 S1 +R1 =54
4 X 1 + 4 X 2 +6 X 3 S 2 + R 2 =65
X 1 +S 3 =7
X 2 +S 4 =7
X 3 +S 5 =7
X 1 , X 2 , X 3 , S 1 , S2 , S3 , S 4 , S 5 , R1 , R2 0
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.

L.V
.

Basis

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

W
R1
R2
S3
S4
S5

1
0
0

8
4
4

10
6
4

7
1
6

0
1
0

0
0
1

1
-1
0

1
0
-1

0
0
0

0
0
0

0
0
0

119
54
65

0
0
0

1
0
0

0
1
0

0
0
1

0
0
0

0
0
0

0
0
0

0
0
0

1
0
0

0
1
0

0
0
1

7
7
7

Ratio

Ratio
9
65/4
7

e.v.

L.V
.

Basis

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

W
R1
R2
S3
X2

1
0
0
0
0

8
4
4
1
0

0
0
0
0
1

7
1
6
0
0

0
1
0
0
0

0
0
1
0
0

1
-1
0
0
0

1
0
-1
0
0

0
0
0
1
0

-10
-6
-4
0
1

0
0
0
0
0

11
12
37
7
7

3
37/3

L.V
.

S5

e.v.

L.V.

Basis

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

-2

-13

X1
R2
S3
X2
S5

0
0
0
0
0

1
0
0
0
0

0
0
0
1
0

1/4
5
-1/4
0
1

1/4
-1
-1/4
0
0

0
1
0
0
0

-1/4
1
1/4
0
0

0
-1
0
0
0

0
0
1
0
0

-3/2
2
3/2
1
0

0
0
0
0
1

3
25
4
7
7

e.v.

Ratio
12
5

e.v.

L.V.

Basis
W

Z
1

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

-1

-1

-38

X1
X3

0
0

1
0

0
0

0
1

3/10
-1/5

-1/20 -3/10
1/5
1/5

1/20
-1/5

0
0

-8/5
2/5

0
0

7/4
5

S3

-3/10

1/20

3/10

-1/20

8/5

21/5

X2
S5

0
0

0
0

1
0

0
0

0
1/5

0
-1/5

0
-1/5

0
1/5

0
0

1
-2/5

0
1

7
2

Ratio
35

10

e.v.

L.V.

Basis
W
X1
X3
S3
X2
S2

Z
1
0
0
0
0
0

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

0
1
0
0
0
0

0
0
0
0
1
0

0
0
1
0
0
0

-3
1/4
0
-1/4
0
1

1
0
0
0
0
-1

4
-1/4
0
1/4
0
-1

0
0
0
0
0
1

0
0
0
1
0
0

4
-2/3
0
1/3
1
-2

-10
-1/4
0
0
0
5

-58
5/4
7
47/5
7
10

e.v.

e.v.

Ratio

L.V.

Basis

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

Solution

W
X1
X3
S3
S4
S2

1
0
0
0
0
0

0
1
0
0
0
0

-4
2/3
0
-0.333
1
2

0
0
1
0
0
0

-3
1/4
0
-1/4
0
1

1
0
0
0
0
-1

4
-1/4
0
1/4
0
-1

0
0
0
0
0
1

0
0
0
1
0
0

0
0
0
0
1
0

-10
-1/4
0
0
0
5

-86
71/12
7
106/15
7
24

Solution

e.v.

Ratio

e.v.

L.V.

Basis
W
X1
X3
S3
S4
S2

Z
1
0
0
0
0
0

X1

X2

X3

R1

R2

S1

S2

S3

S4

S5

0
1
0
0
0
0

4/3
1/3
0
-4/3
1
2

0
0
1
0
0
0

1
0
0
-1
0
1

1
0
0
0
0
-1

0
0
0
1
0
-1

0
0
0
0
0
1

-4
1
0
1
0
0

0
0
0
0
1
0

-10
-1/4
0
0
0
5

S5

e.v.

Ratio

-2986
779/60
7
424/15
7
7
24
12

e.v.

L.V.

Basis
W
X1
X3
S3
X2
S2

Z
1
0
0
0
0
0

X1

X2

X3

R1

R2

S1

S2

S3

S4

0
1
0
0
0
0

0
0
0
0
1
0

0
0
1
0
0
0

1
0
0
-1
0
1

1
0
0
0
0
-1

0
0
0
1
0
-1

0
0
0
0
0
1

-4
1
0
1
0
0

-4/3
-1/3
0
4/3
1
-2

e.v.

Solution

Ratio

-10 -8986/3
-1/4 639/60
0
7
0
564/15
0
7
5
10

e.v.

Basis
W
X1

Z
1
0

X1

X2

X3

R1

R2

S1

S2

S3

S4

0
1

0
0

0
0

0
0

2
0

1
0

-1
0

-4
1

-4/3
-1/3

S5

Solution

-10 -8986/3
-1/4 639/60

Ratio

X3
S3
X2
S2

0
0
0
0

0
0
0
0

0
0
1
0

1
0
0
0

0
0
0
1

0
-1
0
-1

e.v.

0
0
0
-1

0
1
0
1

0
1
0
0

0
-2/3
1
-2

0
5
0
5

7
714/15
7
10

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
X 1=
4
X 2 =7
X 3 =5

Check

Z=

20 7
4

=35+154 +90
=279

+227 + 185