Scribd
Upload
2 views3 pages

L.P. Problem - Unbounded Solution

The document outlines a linear programming problem aimed at minimizing a function subject to various constraints. It details the transformation of the problem into standard form, the introduction of slack variables, and the application of the Simplex method to find the solution. Ultimately, it concludes that the problem results in an unbounded solution due to the characteristics of the variables involved.

Uploaded by

a c s Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views3 pages

L.P. Problem - Unbounded Solution

The document outlines a linear programming problem aimed at minimizing a function subject to various constraints. It details the transformation of the problem into standard form, the introduction of slack variables, and the application of the Simplex method to find the solution. Ultimately, it concludes that the problem results in an unbounded solution due to the characteristics of the variables involved.

Uploaded by

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

Q.

Minimize Z = - 2x1 - 3x2 + x3


Subject to : x1 + 2x2 - x3 ≥ 6
-x1 + x2 - 2x ≤ 3
x1 - x2 + 3x3 ≤ 10, and x1 , x2 , x3 ≥ 0.
Solution :
First, we rewrite the given problem in the standard format, as shown
below:
Maximize Z′ = - Z = 2x1 + 3x2 - x3
Subject to : x1 + 2x2 - x3 ≥ 6
-x1 + x2 - 2x3 ≤ 3
x1 - x2 + 3x3 ≤ 10, and x1 , x2 , x3 ≥ 0.
Now, by introducing the Slack / Surplus variables in the constraints, we
get :
Maximize Z' = 2x1 + 3x2 - x3 + 0.S1 + 0.S2 + 0.S3 – M.A1
Subject to : x1 + 2x2 - x3 - S1 + 0.S2 + 0.S3 + A1 = 6
-x1 + x2 - 2x3 + 0.S1+ S2+ 0.S3 + 0.A1 = 3
x1 - x2 + 3x3 + 0.S1+ 0.S2+ S3 + 0.A1 = 10,
and x1 , x2 , x3 , S1, S2, S3, A1 ≥ 0.
Starting Simplex Table :
cj 2 3 -1 0 0 0 -M  xB 
Basic CB xB Y1 Y2 Y3 Y4 Y5 Y6 Y7  
 Yin 
Min.Rati0
Variable
A1 -M 6 0 0 1 (6/2) = 3
1 2 -1 -1
S2 0 3 1 0 0 (3/1) = 3
-1 1 -2 0
S3 0 10 0 1 0 --
1 -1 3 0
Z′=[CB]. -M-2 -2M-3 M+ M 0 0 0 j
T
[xB] = -6M 1
Thus, we find that the Minimum ratio is not unique, hence it is a case
of Degeneracy. ∴ We have to interchange the column vectors such that
the vectors of Unit matrix are written first, followed by the other column
vectors, as shown below.
Modified Simplex Table to remove Degeneracy:
cj 0 0 -M 2 3 -1 0  xB 
Basic CB xB Y5 Y6 Y7 Y1 Y2 Y3 Y4  
Min.Rati0  Yin 
Variable
A1 -M 6 0 0 1 (0/2) = 0
1 2 -1 -1
S2 0 3 1 0 0 (1/1) = 1
-1 1 -2 0
S3 0 10 0 1 0 --
1 -1 3 0
′
Z =[CB]. 0 0 0 -M-2 -2M- M+ M j
[xB]T= -6M 3 1

Now, we find the ratio of , i = 1, 2, 3 to find the Minimum ratio,


where i denotes the rows. This is shown in the above table. Thus, the
minimum ratio of ‘0’ is unique, hence we can proceed with the usual
Simplex procedure further on.
Modified Simplex Table :
cj 0 0 -M 2 3 -1 0 Min.Rati0
Basic CB xB Y5 Y6 Y7 Y1 Y2 Y3 Y4  xB 
Variable  
 Yin 
x2 3 3 0 0 0.5 --
0.5 1 -0.5 -0.5
S2 0 0 1 0 -0.5 (0/0.5) = 0
-1.5 0 -1.5 0.5
0.5
S3 0 13 0 1 0.5 --
1.5 0 2.5 -0.5
′
Z =[CB]. 0 0 M+ -0.5 0 -0.5 -1.5 j
[xB]T= 9 1.5

Modified Simplex Table :


cj 0 0 -M 2 3 -1 0 Min.Rati0
Basic CB xB Y5 Y6 Y7 Y1 Y2 Y3 Y4  xB 
Variable  
 Yin 
x2 3 3 1 0 0 --
-1 1 -2 0
S1 0 0 2 0 -1 --
-3 0 -3 1
S3 0 13 1 1 0 (13/1) = 13
0 0 1 0
′
Z =[CB]. 3 0 M -5 0 -5 0 j
[xB]T= 9

Thus, we find that the (  j) value of (-5) is the same for both Y 1 and
Y3. However, if we look at the elements of Y 1, we find that all of them
are ≤ 0, hence Y1 can not enter into the basis matrix. Therefore, we
choose Y3 as the Incoming vector.
Modified Simplex Table :
cj 0 0 -M 2 3 -1 0 Min.Rati0
Basic CB xB Y5 Y6 Y7 Y1 Y2 Y3 Y4  xB 
Variable  
 Yin 
x2 3 29 3 2 0 --
-1 1 0 0
S1 0 39 5 3 -1 --
-3 0 0 1
x3 -1 13 1 1 0 (13/1) = 13
0 0 1 0
Z′=[CB]. 8 5 M -5 0 0 0 j
[xB]T=

Now, the only (-ve)  j is for Y1, but Y1 can not enter into the basis
matrix, because all the elements of the vector Y1 are ≤ 0. ∴ This
problem has an Unbounded Solution.

You might also like