where n = number of variables = 6 m = number of constraints = 2 \
number of basic solutions =
nCm = 6C2 6!
= (6-2)! * 2!
6*5*4*3*2*1
= (4*3*2*1) * (2*1)
= 15
Now, two variables may be selected as a basic variable, thus the
set of basic variables can be expressed as :-
Number of basic variables = {(x1,x2),
(x1,x3), (x1,x4),
(x1, s1) (x1, s2)
(x2, x3) (x2, x4)
(x2,s1) (x2,s2)
(x3, x4) (x3,s1)
(x3,s2) (x4, s1)
(x4,s2) (s1, s2)} Now if we
take x1 and x2 as basic variables :
We
get the basic solutions as :
Basic variables are x1 and x2.
Non
basic variables are x3 = 0, x4 = 0, s1 =
0, and s2=0.
By placing these all values
in our L.Ps model we get
Therefore basic solutions: X1=0, x2 = ½
and Z = -2
In
this way we can obtain other remaining basic solutions which are mentioned
in the table bellow.
SR.
No.
Basic Variables
1st Variable2nd Variable
Basic Solutions
1st solution2nd solutions
Value of object
function(Z)
1.
x1
x2
0
½
-2
2.
x1
x3
8
3
31
3.
x1
x4
0
1/4
-(3/2)
4.
x1
s1
-1
3
-2
5.
x1
s2
2
3
4
6.
x2
x3
½
0
-2
7.
x2
x4
0
1/4
-(3/2)
8.
x2
s1
½
0
-2
9.
x2
s2
½
0
-2
10.
x3
x4
0
1/4
-(3/2)
11.
x3
s1
1/3
8/3
5/3
12.
x3
s2
-1
4
-5
13.
x4
s1
1/4
0
-(3/2)
14.
x4
s2
1/4
0
-(3/2)
15.
s1
s2
2
1
0
From the above table we can see that the basic solutions and the
basic variables in which we get from the serial no 4 and 12 are negative
because the value of the variables are negative.
We
can also see from serial no 2 that when the value of x1 = 8,
and the value of x3 = 3 we get the maximum value of the
objective function (i.e. Z = 31). Hence the solution for the
above mentioned L.P models is as follows :