Scribd
Upload
33 views2 pages

Example of Simplex Procedure For A Standard Linear Programming Problem

This document provides an example of using the simplex method to solve a linear programming problem. It shows the initial tableau with the objective function and slack variables. It then demonstrates the row operations performed at each step of the simplex method to arrive at the final tableau. The final tableau indicates the optimal solution has been found since all indicators are greater than or equal to zero.

Uploaded by

furlee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
33 views2 pages

Example of Simplex Procedure For A Standard Linear Programming Problem

This document provides an example of using the simplex method to solve a linear programming problem. It shows the initial tableau with the objective function and slack variables. It then demonstrates the row operations performed at each step of the simplex method to arrive at the final tableau. The final tableau indicates the optimal solution has been found since all indicators are greater than or equal to zero.

Uploaded by

furlee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

a Simplex

Below is the
original problem:
objective function
is in green.

EXAMPLE OF SIMPLEX PROCEDURE


FOR A STANDARD
LINEAR PROGRAMMING PROBLEM

See
step
1

The 1st SIMPLEX TABLEAU


is below. Note
missing z-column
(correction by Steve Hulet)

Below are the


results of the
row operations
named above
blue
numbers
are the
new ISM

Red variables below


are called
SLACK VARIABLES

See
step
2

See steps 3,4,5 of


SIMPLEX METHOD
as you handle INDICATORS,
RATIOS, and PIVOTS.

Below is the
SIMPLEX TABLEAU.
Compare RED symbols
with Z = x1 + 2x2 - x3.
Blue numbers below
are the "ISM".

Named below are the 4


row operations needed to
pivot on the number
"5" encircled in red

Named below are


Since one INDICATOR
Below is the result
4 row operations
(namely -1/5) remains
of changing our pivot
needed to pivot
negative, we must
to "1"
on the number(16/5)
repeat steps 3-9
encircled in red

Above there was a tie for least non-negative ratio:


either row 1 or row 2 could have become the pivot row, and either
choice leads to the final tableau after one additional pivoting. At the
right is the result of the final 3 row operations.

All indicators {0, 0,

49
16

, 0,

1
16

and

3
8

} are now zero or bigger ("13" is NOT an indicator).

Thus, as in step 8 of the SIMPLEX METHOD, the last tableau is a FINAL TABLEAU.
Row operations of SIMPLEX METHOD are done.
Thus, the basic solution for the tableau above is the solution to our
original problem.
[1st] set equal to 0 all variables NOT associated with the blue ISM,
as at the right. Each column of the final tableau has a label naming
it's variable.
[2nd] convert each row of the final tableau (except the bottom row)
back into equation form (as at the right) to find the values of the
remaining variables. The value of the objective function is in the
lower right corner of the final tableau.

This page last updated


22 June 2007

You might also like