Section 5.2 Handout

# Section 5.2 Handout - maximumtypeproblems Section5.2 TheSimplexAlgorithm SampleProblem:Maximizef=x 3y subjectto:x y 5 2x y 4 x 0 y 0 Step1)

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

1/29/2008 1 Section 5.2 The Simplex Algorithm How do we use the Simplex Method to solve standard maximum type problems Sample Problem: Maximize f = x+3y Sample Problem: Maximize f x+3y subject to: 0 , 0 4 2 5 + y x y x y x Step 1) Insert the slack variables and find the slack equations. 4 2 5 2 1 = + = + + s y x s y x Step 2) Rewrite the objective function to match the format of the slack equations. 0 3 = + f y x Step 3) Form a matrix corresponding to the system of slack equations with the newly written objective function at the bottom This is called the [ ] the bottom. This is called the initial simplex tableau. 0 4 5 1 0 0 3 1 0 1 0 1 2 0 0 1 1 1 Step 4: Determine the pivot element. The pivot column corresponds to the most negative entry in the indicator row. Use the smallest quotient rule to determine the pivot row. •In this case we will Pivot on the 1

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/12/2012 for the course MATH 2053 taught by Professor Pamelasatterfield during the Spring '08 term at NorthWest Arkansas Community College.

### Page1 / 2

Section 5.2 Handout - maximumtypeproblems Section5.2 TheSimplexAlgorithm SampleProblem:Maximizef=x 3y subjectto:x y 5 2x y 4 x 0 y 0 Step1)

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

View Full Document
Ask a homework question - tutors are online