WORKSHEET(6.2) Part I & II

WORKSHEET(6.2) Part I & II - WORKSHEET (6.2) Part I Solve...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
WORKSHEET (6.2) Part I Solve the linear programming using the Simplex Method: Maximize 2 1 10 15 x x P + = Subject to 10 2 2 1 + x x 10 3 2 1 + x x 0 , 2 1 x x Step1: Convert the LP problem to a system of linear equations adding slack variables. Step 2: Set up the initial tableau. P s s P s s x x 2 1 2 1 2 1 Step 3: Chose the pivot column by selecting the most negative indicator in the bottom row. (If you find two equally large negative numbers, it doesn't matter which you choose.) Step 4: Chose the pivot element by using the smallest test ratio in the pivot column. (If there is a tie for the smallest test ratio, choose either.) (If the pivot column has no positive elements, there is no solution, and we stop.) The row with the smallest result is the pivot row . The pivot element is the number in both the pivot column and the pivot row. The entering variable is the variable at the top of the pivot column (x 1 in this case).
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/08/2010 for the course MATH 70 at San Jose State.

Page1 / 5

WORKSHEET(6.2) Part I & II - WORKSHEET (6.2) Part I Solve...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online