5-3 - 5-3 Introduction to the Simplex Methodthe geometric...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: 5-3 Introduction to the Simplex Methodthe geometric methodonly works for problems that have two variablesrequires solving a system for every corner pointreal problems may require hundreds of variables and hundreds of constraintswhich means astronomical numbers of corner pointsmaking the above technique impracticaleven on super-computersthe Simplex Methodprovides an efficient procedurefor solving such large problemswe introduce some of the conceptsand vocabularyassociated with the Simplex Methodwe will not show it in its entirety, due to lack of time5-3p. 1We use the following example (from the book):Constraints:x1+ 2x2323x1+ 4x284x1, x2Objective function:P = 50x1+ 80x2Although the Simplex Methoddoes not rely on graphing, we will refer to its graphical solution:5-3p. 2(32,0)(28,0)(20,6)(0,16)(0,21)3x1+ 4x2= 84x1+ 2x2= 32feasible regionSLACKVARIABLESThe Simplex Methodstarts by converting our constraintswhich are inequalitiesinto "equalities", or...
View Full Document

Page1 / 6

5-3 - 5-3 Introduction to the Simplex Methodthe geometric...

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

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