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
1

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 per Interior Paint from Per Maximum Daily
ton of Raw Material
Ton of Raw Material
Availability (tons)
Raw Material 1

24

Raw Material 2

Profit per ton (in 1000 5

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
2

and

x1 ,x 2 0
Now introducing slack variables s1 , s2 , s3 , and s4 the given problem can be written as the following
standard form

Maximize
Maximize: z=5x1 +4x 2 +0s1 +0s2 +0s3 +0s4