The Simplex Method in Tableau Format

A very useful tabular form displaying all the quantities of

interest has been developed by Orden, Datzig and Holfman.
The systematic arrangement of solving a linear programming
problem in a tabular format is known as a tableau and a new
tableau is constructed at each iteration i.e. each time a new
vector is introduced into the basis.
*The first column of tableau gives CB that is cost coefficient
of basic variables.
*The second column tells which vectors are in the basis
* The right hand side column under the heading b of a
tableau gives you the current value of the x B together with the
value of the objective function for the basic feasible solution.
The remaining columns list the values of y j for all vectors
in A and any artificial vectors which may have
been added.
Suppose we have a starting basic feasible
solution x with basis B. The linear programming
problem can be represented as follows
Minimize: z = CB x B +CN x N
Subject to

z-CB x B -C N x N = 0

(1)

Bx B +Nx N = b

(2)

xB , xN 0

(3)
-1
Multiplying equation (2) by B we have
x B +B-1 Nx N = B-1b

(4)
1

Now multiplying the equation (4) by CB and adding the

equation (1) with the resulting equation we have
z-CB x B -C N x N +CB x B +CB B-1Nx N = C B B-1b
z+0.x B +(C B B-1N-C N )x N = C B B-1b

(5)
Currently x N =0 , and from equation (4) and (5) we have
x B = B-1b

z = C B B-1b

and
The equations (4) and (5) can conveniently be represented the
current basic feasible solution in the following tableau. Here
we think of z as (basic) variable to be minimized. The
objective row will be referred to as row zero and the
remaining rows are rows 1 through m. The right hand side
column will denote the values of the basic variables including
the objective function. The basic variables are identified on
the left column. The tableau representation of the LPP is
given below;
RHS
x
x
z
B

xB

1
0

0
I

(C B B-1 N-C N )

CB B-1b

Row 0

B-1 N

B-1b

Rows 1 through m

C B B-1b

This tableau gives us the objective function

and the
-1
basic variables B b on the RHS. This also gives us all the
information we need to proceed with the simplex method.
Actually the cost row gives us

(CB B-1 N-C N )

which consists of

the Z j -C j for all j (j =1, 2,..,N) non basic variables. The

row zero will tell us if we are at the optimal solution if each
Z j -C j 0

and which non-basic variable to increase otherwise.

-1
x
y
=B
a k which is
k
k
If
is increased then the vector

stored in the tableau in rows 1 through m under

2

the variable x k can be increased indefinitely

without being blocked and the optimal is
unbounded. On the other hand if y k has at least
one positive component then increased of x k will
be blocked by one of the current basic variable
which droops to zero. The minimum ratio test
determines the blocking variables. We would like
to have a scheme that will do the following
(i) Update the basic variables and their values
(ii)Update Z j -C j values for the new non basic
variables
(iii) Update y j columns
That is represent the following tableau form.
z

Basic Variables
x B1 x B2
x
x
Br .. Bm
0 0 0 .. 0

x B1

0.................0...... 0
1 0.. 0

x Br

0
.
.

x B2
.

.
.

x Bm

.
.
0
.
.

0
.
.
.
.
0

Non-Basic
x
x k
j
Z -C
j j Zk -Ck
y
1j . y1k ..
y
y
2j . 2k .
.
.
.

.
.
.
.

0 1.. 0

y rj

..

y mj

y rk ..

y
mk .

RHS
CB b
b1

b2
.
.
.

br
.
.
.

bm

00 1

.
0

Pivoting:
All of the foregoing tasks can be simultaneously done by a
simple pivoting operation.
3

If x k enters the basis and x B leaves the basis, then

r

pivoting on yrk can be stated as follows;

(i) Divide row r by yrk . Thus we can write that
New pivot row = Current pivot row Pivot Element
(ii) For all other rows that is for i = 1, 2,,m
except row r, update the ith row by adding to it
-yik times the new pivot row. That is new row is

given by
New row = Current row + (- its pivotal column
coefficient) (New pivotal row)
(iii) Update row zero by adding to it -(Zk -Ck ) times the
new rth row.Thus the new pivotal row is given by
z

Basic Variables
x B1 x B2
x
x
Br .. Bm
0 0 0 .. 0

x B1

0.................0...... 0
1 0.. 0

0
.
.

x B2
.

.
.

xk
.

.
.

x Bm

.
.

0
.
.

.0

Non-Basic
x
x k
j
Z -C
j j Zk -Ck
y
1j . y1k ..
y
y
2j . 2k .

RHS
CB b

b1
b2
.
.

.
.
..
.
.

0 1/ y rk .. 0

y rj y rk

...

y mj

.1..

y mk

br y rk
R
.
.
.
.

NP

bm

00 1

.0

Thus the after pivoting the tableau is given by

Basic Variables
z
z

x B1 x B2
0

x Br

Non-Basic
..

-(Zk -Ck ) / y rk ..

x Bm

k
j
(Z -C )-(y /y )(Z -C )
j j rj rk k k 0

RHS
C B b-(br /y rk )(Z k -C k )

x B1

x B2
.

.
.

xk

0
.

0.............

-y1k /y rk ...... 0

0 1/

.
.

x Bm

0
.
.

.0

.
.

-y 2k /y rk . 0

0
.
.

y1j -(y rj /y rk )y1k

y 2j -(y rj /y rk )y 2k

0.

..

.1..

y rk .. 0

y rj y rk

y mj -(y rj /y rk )y mk

0 ..

b1 -(br /y rk )y1k

b2 -(br /y rk )y 2k
.
.
.
.
.
.

br y rk
/

NPR

bm -(br /y rk )y mk

-y mk /y rk 1

.
0

Let us now examine the implications of the pivoting

operations
(i) The variable x k enters the basis and x B left the basis. This
is illustrated on the left hand side of the tableau by replacing
r

x Br

with x k
(ii) The right hand side of the tableau gives the current values
of the basic variables. The non-basic variables are kept zero
Use of Tableau Format to Obtain the Solution of LPP
Suppose we are to
Minimize: z=Cx
Subject to
Ax = b
x0

Initialization Step:
We find an initial basic feasible solution with basis B, with
x=(x B ,x N ) and solution x B =B-1b , x N =0 , C=(CB , C N ) , A=(B, N)
%

We form the initial tableau as follows;

z
z

Basic Variables
x B1 x B2
x
x
Br .. Bm
0 0 0 .. 0

Non-Basic
x
x k
j
Z -C
j j Zk -Ck

RHS
CB b

x B1

0.................0...... 0
1 0.. 0

0
.
.

x B2
.

.
.

x Br
.

.
.

x Bm

.
.

0
.
.
.
.
0

.
.
0
.
.

y1j

.
.
.

y 2j

.
.
.
.

0 1.. 0

.
.

y rj

..

y 2k .

y mj

y1k ..

y rk ..

y
mk .

b1

b2
.
.
.

br
.
.
.

bm

00 1

.
0

Main Step:

Z k -C k Maximum

C j ; j R

If Zk -C k 0 then stop and the current solution is optimal.

Otherwise examine y k . If y k 0 , then stop and the

optimal solution is unbounded along the ray

-1
y k
B b

; x k 0

xk

ek
0

where ek is the vector of zero except for a 1 at the kth

position.
If y k >0
determine the index r is as follows;
b

br
= Minimum i ; yik 0
y rk
1i m
yik

Update the tableau by pivoting at yrk . Update the basic

and non basic variables where x k enters the basis
and x B leaves the basis and repeat the main step.
Identification of Different Terms in the Tableau
(i) x B is the vector of basic variables and x N is the vector of
non basic variables
r

-1

(ii) B is the matrix under the slack variables

(iii) B N is the matrix consisting of the vectors
under the non basic variables
(iv) B and N are basic and non basic matrix
-1

CB B-1

(v)
is the vector of
variables
Rate of Change
(i)

z
=-(z j -c j )
xj

C j ; j R

under the slack

is the rate of change of z as a function of the

typical non basic variable x j

(ii)

xB
=-y j
xj

is the rate of change of basic variables

as a function of the non-basic variable x j

(iii)

z
=C B-1
b

is the rate of change of the objective function as a

function of the right hand side vector b
B

xB
=B-1
b

(iv)
is the rate of change of the basic
variables as a function of b
x Bi

(v) b j

is the (i, j) entry of B-1

x Bi

(vi) b

is the ith row of B-1

xB
is the jth column of B-1
bj

(vii)
Interpretation of Entries in the Simplex
Tableau
Let us consider the following typical simplex
7

tableau
x
x
z
RHS
Z
Row 0
(C B N-C )
C B b
1
0
Rows 1 through m
x
B N
B b
0
I
The tableau may be thought of as a representation of both the
basic variables x B and the cost variable z in terms of the non
basic variables x N
The non basic variables can therefore be thought of as
independent variables where as x B and Z are the dependent
variables
From row zero we have
B

-1

-1

-1

-1

z = C B B-1b - (C B B-1 N-C N )x N

z = C B B-1b - (z j -C j ) x j
jR

Now,

z
=-(z j -c j )
xj

is the rate of change of z with respect to non-

basic variable x j

z
<0
xj

In order to minimize z, we should increase x j if

Also the basic variables can be represented in terms of non
basic variables as follows
x B = B-1b-B-1 Nx N
=B-1b- y j x j
jR

xB
=-y j
xj

Now,
, is the rate of change of the basic
variables as a function of the non basic variable
xj

. In other words of x j is increased by 1 unit the

8

basic variable decrease by yij units

The simplex tableau also gives us a convenient way of
predicting the rate of change of the objective function and the
value of the basic variables as a function of the right hand
side vector
z = C B B-1b - (z j -C j ) x j
jR

(iii)

z
=C B-1
b

is the rate of change of the objective function as a

function of the right hand side vector b
B

xB
=B-1
b

(iv)
is the rate of change of the basic
variables as a function of b
x Bi

(v) b j

is the (i, j) entry of B-1

x Bi

(vi) b

is the ith row of B-1

xB
is the jth column of B-1
bj

(vii)
If the tableau corresponds to a degenerate basic feasible
solution, then as a non basic variable x j increases at
least one of the basic variables may become
immediately negative destroying feasibility. In
this case a change of basis is necessary to
restore feasibility, leading to non-differentiability
to the objective value as a function of x j
Problem:
Minimize: z= x1 x 2 -4x 3

Subject to

x1 +x 2 +2x 3 9
x1 +x 2 -x 3 2

-x1 +x 2 +x 3 4
x1 , x 2 , x 3 0

Solution: Introducing the slack variables x 4 , x 5 , and x 6 , the

given problem can be written as the standard
form
Minimize: z= x1 x 2 -4x 3 0.x 4 +0.x 5 +0.x 6
x1 +x 2 +2x 3 +x 4 =9
x1 +x 2 - x 3
-x1 +x 2 +x 3

+x 5 =2
+ x 6 =4

x1 , x 2 , x 3 x 4 , x 5 , x 6 0

The system of equation can be written as the matrix form as

follows
Minimize z = Cx
Subject to
Ax = b
x0

x1

x 2
x 3
x=
x 4
x
5
x
6

1 1 2 1 0 0

A= 1 1 -1 0 1 0
-1 1 1 0 0 1

9

b= 2
4

where C= (1, 1, -4, 0, 0, 0)

,
Since b 0 , thus we can choose our initial basis as
B=(a 4 , a 5 , a 6 )=I and we indeed have B-1b =b 0 . This gives the
following tableau
Iteration 1

10

z
1
0
0
0

X1 X2
X3
X4 X5 X6
z
-1
-1
4
0
0
0
X4
1
1
2
1
0
0
X5
1
1
-1
0
1
0
X6
-1
1
1
0
0
1
PC
Here we choose x 3 to enter the basis because
Z3 -C 3 4 Minimum

RHC
0
9
2
4PR

C j; j R

Now,

Basic Variables
x4
x5
x6

x3( yi3 )
2
-1
1

br
y rk (ratio or Intercept)

9
2
4

4.5
-2 (Ignore)
4 (Minimum)

We are interested only in the nonnegative ratios because they

represent the direction of increase x3. The minimum non
negative ratio provides the value of the entering variable x3 in
the new solution namely x3 = 4. The corresponding value of
the objective function will be -16. Next we determine the
leaving variable from among the current basic variables x4,
x5 and x6 that should be forced to zero when x3 enters. Here
x6 is the leaving variable because x6 is associated with the
b

b
br
= Minimum i ; yik 0 3 4
y rk
y33
1 i m
yik

smallest nonnegative ratio ie,

.
Replacing the leaving variable x6 with entering
variable x3 produces the new basic solution (x4,
x5 and x3). The computation of the new basic
solution is based on the Gauss-Jordan row
operation. The Gauss-Jordan row operation is
given by
(i) Pivotal Row
11

New pivotal row = Current pivotal row/Pivot

element
(ii) All other rows including z
New row = Current row-(Its pivot column coefficient) (New pivot row)

The new pivotal row is given below;

z
x4
x5
x3

x1

x2

x3

x4

-1

x5

x6

Solution

4 New
Pivotal Row

Type ii computations are applied to the remaining rows as

follows

(1) Zero Row

Current zero Row
4 New Pivotal Row

New Zero Row

1
0
1

-1
4
3

-1
-4
-5

4
-4
0

0
0
0

0
0
0

0 0
-4 -16
-4 -16

0
0
0

1
2
3

1
-2
-1

2
-2
0

1
0
1

0
0
0

0 9
-2 -8
-2 1

0
0
0

1
-1
0

1
1
2

-1
1
0

0
0
0

1
0
1

0
1
1

2. X4 Row

Current X4 Row
2 New Pivotal Row

New X4 Row
3. X5 row
Current x5 Row
( 1) New

Pivotal Row

New x5 Row
Iteration 2

12

2
4
6

z
X1
X2
X3
X4
X5
X6
RHC
z
1
3
-5
0
0
0
-4
-16
X4
0
3
-1
0
1
0
-2
1PR
X5
0
0
2
0
0
1
1
6
X3
0
-1
1
1
0
0
1
4
Pivotal Column
Observe that the new tableau has the same properties as the
starting tableau. When we set the non basic variables x1, x2
and x6 to zero, the solution column automatically yields the
new basic solution ( x4=1, x5=6 and x3=4) together with the
corresponding new value of z is -16.
The last tableau shows that it is not optimal because the non
basic variable x1 has positive coefficient in the z-rows. An
increase in x1 is advantages because it will decrease the value
z. Thus x1 is the entering variable.
Next we will determine the leaving variable by computing the
ratio of the constraints with the nonnegative direction of the
entering variable.
Basic Variables

x1

b 9Solution)

br
y rk (ratio or Intercept)

x4
x5
x3

3
0
-1

1
6
4

1/3 (minimum)
6/0 (undefined) Ignore
4/-1 = -4 (Ignore)

The computations show that x4 leaving variable and x1 will

enter the new basic solution as the value 1/3 (the smallest
non-negative ratio). The corresponding increase in z is (3X1/3)=-1 yielding new z =-16-1 =-17
13

The pivotal row is given by x4-row and pivotal column is

associated with x1.
New pivotal row = current x4-row/3
z
x1
x5
x3

x1

x2

x3

x4

x5

-1/3

1/3

x6

RHS
-16
1 /3(Pivotal
Row)

-2/3

The remaining rows are obtained by using Gauss-Jordan row

operation technique as follows
(1) Zero Row
Current zero Row
1 3 -5 0 0
0 0
-16
(3) New Pivotal Row
0 -3 1
0 -1 0 2
-1
New Zero Row 1 0 -4 0 -1 0 -2 -17
2. X5 Row

Current X5 Row
(0) New

Pivotal Row

New X5 Row
3. X3 row
Current x3 Row
( 1) New

Pivotal Row

New x3 Row

0
0
0

0
0
0

2
0
2

0
0

-1
1

1
1
-1/3 0

0
0
0

2/3 1

These computations produce the following tableau

Iteration 3
z
x1
x2 x3 x4
x5
x6
z
1
0
-4 0
-1
0
-2
x1
0
1
-1/3 0
1/3 0
-2/3
x5
0
0
2
0
0
1
1
x3
0
0
2/3 1
1/3 0
1/3
Pivotal Column)

0
0
0

1
0
1

1
0
1

6
0
6

0
0
1/3 0

1
-

4
1/3

1/3 0

2/3
1/3 13/3
RHS
-17
1/3
6
13/3

Since z j C j 0 j for all non-basic variables, hence it is the

14

optimal tableau. The optimal solution is

(x1, x2, x3, x4, x5, x6) = (1/3, 0, 13/3, 0, 6, 0).
The optimal value of the objective function is -17
The basic matrix is given by
1 0 2

B =(a1, a5, a3) = 1 1 1

-1 0 1

From iteration 2 we have

B-1

1 0 -2

= 0 1 1
0 0 1

3 -1 -2

B-1 N = 0 2 1
-1 1 1

-1

1 1 0

N= a1, a2, a6 = 1 1 0
-1 1 1

-1

C B B = (0, 0, -4), C B B b= -16

x5
zx 3
x4
z
z
z
=-3,
=5,
=4
=-3,
=0,
=1
x1
x2
x6
x1
x1
x1

xB

x1

xB
0;

x
2

xB

2 ;
x6

0
0

2 z
b
1

b1
z

b 2
z

b3

From Iteration 3 we have

B-1

1/3 0 -2/3

= 0 1 1
1/3 0 1/ 3

C B B-1 = (-1, 0, -2), C B B-1b= -17

1/ 3
xB

z
z
z
2
=4,
=1,
=2 x 2

x2
x4
x6
2 / 3
;

Example: Suppose a company produces both interior and

exterior paints from two raw materials 1 and 2. The following
table provides the basic data of the problem;
Exterior Paint from Interior Paint from Maximum Daily
15

per ton of Raw Per Ton of Raw Availability (tons)

Material
Material
Raw Material 1
6
4
24
Raw Material 2
1
2
6
Profit per ton (in 5
4
1000 USD)

A market survey restricts the maximum daily demand of

interior paint to 2 tons. Additionally the daily demand for
interior paint cannot exceed that of exterior paint by more
than 1 ton. Determine the best product mix of interior and
exterior paints using simplex method (matrix form) for which
the daily profit will be maximum level.
Solution: Let the variable x1 and x 2 indicate the quantity of
exterior and interior paints to be produced. Here the objective
function is given by
z=5x1 +4x 2

and the constraints are given by;

6x1 +4x 2 24
x1 +2x 2 6
x 2 -x1 1
x2 2

and

x1 ,x 2 0

Now introducing slack variables x 3 , x 4 , x 5 and x 6 the given

problem can be written as the following standard form
Maximize: z = 5x1 +4x 2 +0.x 3 +0.x 4 +0.x 5 +0.x 6
6x1 +4x 2 +x 3 =24
x1 +2x 2 x 4 =6
x 2 -x1 x 5 =1
x 2 x 6 =2
x i 0 for i=1, 2,.......,6
which is equivalent to

Minimize: z = -5x1 -4x 2 +0.x 3 +0.x 4 +0.x 5 +0.x 6

16

6x1 +4x 2 +x 3 =24

x1 +2x 2 x 4 =6
x 2 -x1 x 5 =1
x 2 x 6 =2
x i 0 for i=1, 2,.......,6

That is Minimize z = Cx
Ax=b
x0

x1

x 2
x 3
6
x=

x 4
1
x A= -1
5

x
6 ;
0
where, C = (-5, -4, 0, 0, 0, 0) ,

4
2
1
1

1
0
0
0

0
1
0
0

0
0
1
0

0
24

0
6
b=
1
0

1
;
2

Since b 0 , thus we can choose our initial basis as

B=(a 3 , a 4 , a 5 , a 6 ) and we indeed have B-1b =b 0 . This gives the
following tableau
Iteration 1
z
x3
x4
x5
x6

z
1
0
0
0
0

x1 x2
x3 x4
5
4
0 0
6
4
1 0
1
2
0 1
-1 1
0 0
0
1
0 0
Pivotal column

x5
0
0
0
1
0

x6

RHS
0
24 Pivotal row
6
1
2

0
0
0
0
1

Here we choose x1 to enter the basis because

Z1 -C1 6 Maximum

C j ; j R

Now,

Basic Variables

x1 ( yi1 )

bi
yi1 (ratio or Intercept)

X3
x4
x5
x6

6(Pivotal Element)
1
-1
0

24
6
1
2

4
6
-1 (Ignore)
(Ignore)

We are interested only in the nonnegative ratios because they

17

represent the direction of increase x1. The minimum non

negative ratio provides the value of the entering variable x1 in
the new solution namely x1 = 4. The corresponding value of
the objective function will be -20. Next we determine the
leaving variable from among the current basic variables x3,
x4, x5 and x6 that should be forced to zero when x1 enters.
Here x3 is the leaving variable because x3 is associated with
the
smallest
nonnegative
ratio
ie
b

br
b
= Minimum i ; yik 0 1 4
y rk
yi3
1 i m
yik

Replacing the leaving

variable x3 with entering variable x1 produces
the new basic solution (x1, x4 x5, and x6). The
computation of the new basic solution is based
on the Gauss-Jordan row operation. The
Gauss-Jordan row operation is given by
(i) Pivotal Row
New pivotal row = Current pivotal row/Pivot
element
(ii) All other rows including z
New row = Current row-(Its pivot column coefficient) (New pivot row)

The new pivotal row is given below;

z
x1
x4
x5
x6

x1

x2

x3

x4

x5

x6

Solution

2/3

1/6

4 New Pivotal Row

Type 2 computations are applied to the remaining rows as

follows
18

1. z-row
Current z-row
-(5)

New Pivot row

1
0

5
-5

New z row
1
2. x4-row
Current x4-row 0
-(1) New Pivot row
0
New x4- row
0

0
0

0
0

0
-20

4
0
0
-5/6 0
10/3
2/3 -5/6 0

-20

1
-1
0

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

0
0
0

0
0
0

6
-4
2

-1
1
0

1
2/3
5/3

1
0
1

0
0
0

1
4
5

3. x5-row

Current x5-row 0
-(-1) New Pivot row
0
New x5- row
0

0
0
1/6 0
1/6 0

3. x6-row: The new x6-row remains the same as the current x6-row because its
coefficient in the pivotal column is zero.
All the computations are given below in tableau

Iteration 2
z
x1
x4
x5
x6

z
1
0
0
0
0

x1
0
1
0
0
0

x2
2/3
2/3
4/3
5/3
1

x3 x4
-5/6 0
1/6
0
-1/6 1
1/6
0
0
0

x5
0
0
0
1
0

x6
0
0
0
0
1

RHS
-20
4
2Pivotal
row
5
2

Pivotal column

Observe that the new tableau has the same properties as the
starting tableau. When we set the non basic variables x2, and
x3 to zero, the solution column automatically yields the new
basic solution ( x1=4, x4=2, x5=5 and x6=2) together with the
corresponding new value of z is -20.
The last tableau shows that it is not optimal because the non
basic variable x2 has positive coefficient in the z-rows. An
increase in x2 is advantages because it will decrease the value
19

z. Thus x2 is the entering variable.

Next we will determine the leaving variable by computing the
ratio of the constraints with the nonnegative direction of the
entering variable.
Basic Variables
X1
X4
X5
X6

X2( yi2 )

b (Solution)

bi
yi2 (ratio or Intercept)

2/3
4/3Pivotal E
5/3
1

4
2
5
2

6
3/2 (Minimum)
3
2

The computations show that x4 leaving variable and x2 will

enter the new basic solution as the value 3/2 (the smallest
non-negative ratio).
The pivotal row is given by x4-row and pivotal column is
associated with x2.
New pivotal row = current x4-row/4/3
z
x1
x2
x5
x6

x1

x2

x3

x4

-1/8 3/4

x5 x6

RHS
-20

3/2(Pivotal Row)

The remaining rows are obtained by using Gauss-Jordan row

operation technique as follows
1. z-row

Current z-row
-(2/3)

New Pivot row

New z row

1
0

0
0

0
0

1
0

2/3 -5/6 0
0
-2/3 1/1 0
2
1/2
0
-3/4 0
1/2

0
0

-20
-1

-21

2/3 1/6
-2/3 1/1

0
0

4
-1

2. x1-row
Current x1-row
-(2/3)

New Pivot row

20

0
-

0
0

New x1- row

2
1/4

1/2
0
1/2

0
0

0
0

5/3 1/6
-5/3 5/2
4
0
3/8

0
1
0
5/4
1
5/4

0
0

5
-5/2

5/2

New Pivot row

0
0

0
0

1
-1

0
0
0
1/8 0
3/4
1/8 0
3/4

1
0

2
-3/2

New x6- row

1/2

3. x5-row
Current x5-row
-(5/3)

New Pivot row

New x5- row

4. x6-row:
Current x6-row
-(1)

These computations produce the following tableau

Iteration 3
z
x1 x2 x3
x4
x5
x6
z
1
0
0
-3/4 -1/2
0
0
x1
0
1
0
1/4 -1/2
0
0
x2
0
0
1
-1/8 3/4
0
0
x5
0
0
0
3/8 -5/4
1
0
x6
0
0
0
1/8 -3/4
0
1

RHS
-21
3
3/2
5/2
1/2

Since z j C j 0 j for all non-basic variables, hence it is the

optimal tableau. The optimal solution is
(x1, x2, x3, x4, x5, x6) = (3, 3/2, 5/2,).
The optimal value of the objective function is -17
The basic matrix is given by
1 0 2

B =(a1, a5, a3) = 1 1 1

-1 0 1

21

From iteration 2 we have

B-1

1 0 -2

= 0 1 1
0 0 1

3 -1 -2

B-1 N = 0 2 1
-1 1 1

-1

1 1 0

N= a1, a2, a6 = 1 1 0
-1 1 1

-1

C B B = (0, 0, -4), C B B b= -16

x5
zx 3
z
z
z
x4
=-3,
=5,
=4
=-3,
=0,
=1
x1
x2
x6
x1
x1
x1
3
xB xB
0 ;
x1
x2
1

xB

2 ;
x6

1

1
1

0
z
0
b

b1
z

b 2
z

b3

From Iteration 3 we have

B-1

1/3 0 -2/3

= 0 1 1
1/3 0 1/ 3

C B B-1 = (-1, 0, -2), C B B-1b= -17

1/ 3
xB

z
z
z
2
=4,
=1,
=2 x 2
2 / 3
x2
x4
x6

22