Scribd
Upload
36 views

Standard Simplex Method Example

This document provides an example of using the simplex method to solve a standard linear programming problem. It shows the initial tableau with the objective function and constraints. It then demonstrates the steps of the simplex method, including choosing a pivot element, performing row operations, and checking for a optimal solution. When complete, the final tableau provides the values of the basic variables that maximize the objective function.

Uploaded by

Sandip Ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

Standard Simplex Method Example

This document provides an example of using the simplex method to solve a standard linear programming problem. It shows the initial tableau with the objective function and constraints. It then demonstrates the steps of the simplex method, including choosing a pivot element, performing row operations, and checking for a optimal solution. When complete, the final tableau provides the values of the basic variables that maximize the objective function.

Uploaded by

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

5/31/12

standard simplex method example

a Simplex

EXAMPLE OF SIMPLEX PROCEDURE FOR A STANDARD LINEAR PROGRAMMING PROBLEM


Below is the SIMPLEX TABLEAU. Compare RED symbols with Z = x 1 + 2x 2 - x 3. Blue numbers below are the "ISM".

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

See step 1

Red variables below are called SLACK VARIABLES

See step 2

The 1st SIMPLEX TABLEAU is below. Note missing z -column (correction by Steve Hulet)

See steps 3,4,5 of SIMPLEX METHOD as you handle INDICATORS, RATIOS, and PIVOTS.

Named below are the 4 row operations needed to pivot on the number "5" encircled in red

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

Since one INDICATOR (namely -1/5) remains negative, we must repeat steps 3-9

Below is the result of changing our pivot to "1"

Named below are 4 row operations needed to pivot on the number(16/5) encircled in red

math.uww.edu/~mcfarlat/s-prob.htm

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

1/2

5/31/12

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.

standard simplex method example

All indicators {0, 0,

49 16

, 0,

1 16

and 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

math.uww.edu/~mcfarlat/s-prob.htm

2/2

You might also like