L12_Explanation of Simplex Tableau Entries (Contd)

# L12_Explanation of Simplex Tableau Entries (Contd) - In...

This preview shows pages 1–7. Sign up to view the full content.

In this presentation we illustrate the ideas developed in the previous presentation with two more problems

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Consider the following LPP: Maximize 1 2 3 6 2 z x x x = + + Subject to 1 2 3 1 2 3 1 2 3 1 2 3 1 2 2 2 2 3 4 2 3 2 1 2 1 2 , , 0 x x x x x x x x x x x x + + ≤ - - - ≤ + + ≤
Let x 4 , x 5 , x 6 denote the slack variables for the respective constraints. So the starting simplex tableau is Basic z x1 x2 x3 x4 x5 x6 Sol z x4 x5 x6 1 0 0 0 -6 2 -4 1 -1 2 -2 2 -2 1/2 -3/2 1/2 0 1 0 0 0 0 1 0 0 0 0 1 0 2 3 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
After we apply the Simplex method a portion of the final tableau is as follows: Basic z x1 x2 x3 x4 x5 x6 Sol z x5 x3 x1 1 0 0 0 2 1 -2 1 0 1 0 0 2 2 4 -1 Identify the missing numbers.
We first observe that as x 1 is the 3rd basic variable, the x 1 column in the final tableau (including the objective function row) will be 0 0 0 1             Similarly as x 3 is the 2nd basic variable, the x 3 column in the final tableau (including the objective function row) will be 0 0 1 0            

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Basic Matrix is 0 1/ 2 2 1 3/ 2 4 0 1/ 2 1 B
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 21

L12_Explanation of Simplex Tableau Entries (Contd) - In...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online