Transcription of Some Simplex Method Examples
{{id}} {{{paragraph}}}
Name:February 27, 2008 Some Simplex Method ExamplesExample 1: (from class) Maximize:P= 3x+ 4ysubject to: x+y 42x+y 5x 0,y 0 Our first step is to classify the problem. Clearly, we are going to maximize our objec-tive function, all are variables are nonnegative, and our constraints are written withour variable combinations less than or equal to a constant. So this is astandard max-imization problemand we know how to use the Simplex Method to solve need to write our initial Simplex tableau. Since we have two constraints, we needto introduce the two slack variablesuandv. This gives us the equalitiesx+y+u= 42x+y= 5We rewrite our objective function as 3x 4y+P= 0 and from here obtain the systemof equations: x+y+u= 42x+y= 5 3x 4y+P= 0 This gives us our initial Simplex tableau:x y u v P1 1 1 0 042 1 0 1 05-3 -4 0 0 10To find the column, locate the most negative entry to
Some Simplex Method Examples Example 1: (from class) Maximize: P = 3x+4y subject to: x+y ≤ 4 2x+y ≤ 5 x ≥ 0,y ≥ 0 Our first step is to classify the problem. Clearly, we are going to maximize our objec-tive function, all are variables are nonnegative, and our constraints are written with
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}