Assignment

Operation Research

Question one

Maximize Z = 16X1 + 15X2

Subject to: 40X1 + 31X2 ≤ 124

-X1 + X2 ≤1

X1 ≤3

X1,X2 ≥ 0

(a) Solve the problem using graphical method:

(1) 40X1 + 31X2 ≤ 124

X1 = 3.1
X2 = 4

0 + 0 ≤ 124 (true)

(2) -X1 + X2 ≤1
X1 = -1
X2 = 1

0 + 0 ≤ 1 (true)

(3) X1 ≤3
X1 = 3
X2 = 0

0 ≤ 3 (true)

* Optimum Area is (a,b,c,d,e)

(b) Confirm the number of corner points feasible solution using the following formula:

n!
C nm=
m! ( n−m ) !

Where (m) and (n) are the number of equations and number of variables respectively

40X1 + 31X2 + S1 = 124

-X1 + X2 + 0 + S2 = 1

X1 + 0 + 0 + S 3 = 3

o m=3
o n=5
o n-m = 5-3 = 2
o n! = 5*4*3*2*1 = 120
o m! = 3*2*1 = 6
o (n-m)! = 2*1 = 2

5 120
∴ C 3= =10
6 ( 2)
Question Two:

Solve the above linear programming problem using the simplex Method:

 Maximize Z = 16X1 + 15X2 subject to:

 40X1 + 31X2 ≤ 124
 -X1 + X2 ≤ 1
 X1 ≤ 3
 X1,X2 ≥ 0

(1) Start the simplex tableau from the following data:

Z – 16X1 - 15X2 = 0 (objective equation)

40X1 + 31X2 + S1 = 124

-X1 + X2 + 0 + S2 = 1

X1 + 0 + 0 + S3 = 3

Basic Z X1 X2 S1 S2 S3 Soln.
Z 1 -16 -15 0 0 0 0 z-row
S1 0 40 31 1 0 0 124 S1-row
S2 0 -1 1 0 1 0 1 S2-row
S3 0 1 0 0 0 1 3 S3-row
o Non basic variables (X1,X2) , zero variables
o Basic variables: (S1, S2, S3)

(2) Entering value (X1): should be the variable with the most (–Ve) coefficient in the Z row (-16)

Basic Entering (X1) Solution Ratio = (soln/entering)

31
S1 40 124
10
S2 -1 1 -1 (ignore negative)

S3 1 3 3 (minimum)
 Conclusion: X1 enters and S3 leaves

Value of X1 must be increased to 3 at corner (B)

At point (B): the current basic variable S3 at

equation (3) assumes to be zero value and
become the leaving variable

(Enter)
Pivot
column

Basic Z X1 X2 S1 S2 S3 Soln.

Z 1 -16 -15 0 0 0 0

S1 0 40 31 1 0 0 124

S2 0 -1 1 0 1 0 1

(Leave)
S3 0 1 0 0 0 1 3 Pivot
row

 Pivot element = 1
Pivot row:

1) (X1) entering variable will replace basic leaving variable (S 3)

2) New pivot row (new basic X1) = Current pivot row (current basic S 3) ÷ pivot element ( 1 )

Other rows including (Z) :

New row = Current row – (its pivot column coefficient * new pivot row)

Basic Z X1 X2 S1 S2 S3 Soln.

1-(-16*0) = -16-(-16*1) -15-(-16*0) 0-(-16*0) 0-(-16*0) 0-(-16*1) 0-(-16*3)

Z 1 0 -15 0 0 16 48
0-(40*0) 40-(40*1) 31-(40*0) 1-(40*0) 0-(40*0) 0-(40*1) 124-(40*3)
S1 0 0 31 1 0 -40 4
0-(-1*0) -1-(-1*1) 1-(-1*0) 0-(-1*0) 1-(-1*0) 0-(-1*1) 1-(-1*3)
S2 0 0 1 0 1 1 4
0/1 1/1 0/1 0/1 0/1 1/1 3/1
X1 0 1 0 0 0 1 3

o New Basic variables: (X1, S2, S3)

o New nonbasic variables: (X2,S1)

Basic Entering (X2) Solution Ratio = (soln/entering)

4
S1 31 4 (minimum)
31
S2 1 4 4 (ignore)

X1 0 3 ∞ (ignore)

Conclusion: X2 enters and S1 leaves

 New pivot element = 31

 Basic Z X1 X2 S1 S2 S3 Soln.

1-(-15*0) = 0-(-15*0) -15-(-15*1) 0-(-15*1/31) 0-(-15*0) 16-(-15*-40/31) 48-(-15*4/31)

Z 1 0 0 15/31 0 -104/31 1548/31

0/31 0/31 31/31 1/31 0/31 -40/31 4/31

X2 0 0 1 1/31 0 -40/31 4/31

0-(1*0) 0-(1*0) 1-(1*1) 0-(1*1/31) 1-(1*0) 1-(1*-40/31) 4-(1*4/31)

S2 0 0 0 -1/31 1 71/31 120/31

0-(0) 1-(0) 0-(0) 0-(0) 0-(0) 1-(0) 3-(0)

X1 0 1 0 0 0 1 3

 Z-row coefficients linked with the none basic variables S 1, S2 are all positive then this tableau is optimal

∴ X1 = 3

X2 = 4/31

Z = 1548/31

(D) could be the optimum point