Question Number 2:

a. Convert this Simplex problem into standard form (for both Simple Simplex and Simplex Tableau
form):Maximize Z=5X1+18X2+28X3+11X4

Subject to 48X1+27X2+38X3+21X4 ≤ 2400

23X1+19X2+26X3+4X4 ≤ 1160

16X1+26X2+8X3+17X4 ≤ 1840

X1,X2,X3,X4≥0

Solution:

We first convert the problem to canonical form by adding slack variables, obtaining:

Maximize: Z=5X1+18X2+28X3+11X4 + 0S1 + 0S2 + 0S3

Subject to 48X1+27X2+38X3+21X4 + S1 = 2400

23X1+19X2+26X3+4X4 + S2 = 1160

16X1+26X2+8X3+17X4 + S3 = 1840

X1,X2,X3,X4, S1, S2, S3 ≥0

Basic Variables: S1, S2, S3

Non Basic Variables: X1, X2, X3, X4

Assume non-basic variables X1, X2, X3, X4= 0

Coef. in Z 5 18 28 11 0 0 0
Base X1 X2 X3 X4 S S2 S3 bi
Coef. Z Basic Var. 1

0 S1 48 27 38 21 1 0 2400
0 S2 23 19 26 4 0 1 1160
0 S3 16 26 8 17 0 0 1 1840
zj 0 0 0 0 0 0 0

Cj – zj -5 -18 -28 -11 0 0 0

Step B : selection of the entering variable (to the set of  basic variables) 

Maximum of the –  for maximum problems. 

Minimum of the –   for the minimum problems.  

In  our  example:    has  the  greatest  –  ;  hence  it  enters  in  the  set  of  basic 

variables. 

Coef. in Z 5 18 28 11 0 0 0
Base X1 X2 X3 X4 S1 S2 S3 bi
Coef. Z Basic Var.
0 S1 48 27 38 21 1 0 2400
0 S2 23 19 26 4 0 1 1160
0 S3 16 26 8 17 0 0 1 1840
zj 0 0 0 0 0 0 0

Cj – zj 5 18 28 11 0 0 0

Step C : selection of the leaving variable 

In a problem of either min OR max, the leaving variable is the minimum of 

0 

In our example, we need to evaluate: 

Entering variable 

We stop when we reach the optimality criterion. The simplex algorithm stops when: 

Cj – zj ≤ 0 for a maximum problem  

Cj – zj >= 0  for a minimum problem