This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MS&E111 Lecture 4 Introduction to Optimization April 17, 2006 Prof. Amin Saberi Scribed by: Yusuf Ozuysal 1 Solving a linear program In this lecture, we will talk about the simplex algorithm and how it finds the optimum solution for a linear program. First, we will show how to transform all linear programs to a generic form known as the standard form. 1.1 Standard form A linear program is in standard form if: • All its variables are required to be nonnegative • All of its constraints (except the nonnegativity constraints) are in equality form • The constants on the right hand side in all constraints are nonnegative Every linear program can be written in the standard format. For example, consider the linear program: maximize z = 3 x 1 + 2 x 2 x 3 + x 4 subject to x 1 + 2 x 2 + x 3 x 4 ≤ 5 2 x 1 4 x 2 + x 3 + x 4 ≤  1 x 1 ≥ 0 , x 2 ≥ We multiply any constraints in which the right hand side is nonnegative by 1 maximize z = 3 x 1 + 2 x 2 x 3 + x 4 subject to x 1 + 2 x 2 + x 3 x 4 ≤ 5 2 x 1 + 4 x 2 x 3 x 4 ≥ 1 x 1 ≥ 0 , x 2 ≥ 2...
View
Full
Document
This note was uploaded on 09/23/2009 for the course ENGR 62 taught by Professor Unknown during the Spring '06 term at Stanford.
 Spring '06
 UNKNOWN

Click to edit the document details