Simplex+Method+Paper - Running head: SIMPLEX METHOD 1...

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

View Full Document Right Arrow Icon
Running head: SIMPLEX METHOD 1 Simplex Method Team C MTH/212 January 16, 2012 Brandi Robinson
Background image of page 1

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

View Full DocumentRight Arrow Icon
SIMPLEX METHOD 2 Simplex Method Introduction The Simplex Method is a systematic procedure for testing vertex solutions to a linear programming problem. This method was invented by a Russian, named George B. Dantzig in 1947. Mr. Dantzig was also known as the “father of linear programming” (Cottle, R.W. 2005). The simplex method is mostly used for solving linear programming (LP) problems and this method will also determine if no solution even exists. Our goal of this paper is to provide comprehensive material that will explain the simplex method. Below are the parts of the simplex method schematically (Barnett, R.A., Ziegler, M.R., & Byleen, K.E. 2011). . Step 1: Write the standard maximization problem in standard form, introduce slack variables to form the initial system, and write the initial tableau. Step 2: Are there any negative indicators in the bottom row?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/27/2012 for the course MATH 212 212 taught by Professor Robinson during the Spring '11 term at University of Phoenix.

Page1 / 5

Simplex+Method+Paper - Running head: SIMPLEX METHOD 1...

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

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