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

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

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

View Full Document

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.

Unformatted text preview: 5-3 Introduction to the Simplex Methodthe geometric method•only works for problems that have two variables•requires solving a system for every corner point•real problems may require hundreds of variables •and hundreds of constraints•which means astronomical numbers of corner points•making the above technique impractical•even on super-computers•the Simplex Methodprovides an efficient procedure•for solving such large problems•we introduce some of the conceptsand vocabulary•associated with the Simplex Method•we will not show it in its entirety, due to lack of time5-3p. 1We use the following example (from the book):Constraints:x1+ 2x2≤323x1+ 4x2≤84x1, x2≥Objective 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 regionSLACKVARIABLES•The Simplex Methodstarts by converting our constraints•which are inequalities•into "equalities", or...
View Full Document

## This note was uploaded on 12/11/2011 for the course MATH 1324 taught by Professor Staff during the Spring '11 term at Austin Community College.

### 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
Ask a homework question - tutors are online