{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


20091204_141445 - (35 Solve the following linear program...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (35) Solve the following linear program, using the simplex method. You should first add slack variables to form the initial dictionary. Display all of your work as done in the handouts, giving each of the die— tionaries computed along the way to finding the optimal solution. Also give the solution corresponding to each dictionary that you compute. maximize 41:1 + 8x2 -— 633 — 8:34 subject to :51 + 4:122 — an; g 4 $1 + 372 — 5133 S 8 J 331' 2 0, '1. = 1, . ,4 (Hint: We have discussed in class that there are many rules for deciding which variable to increase, when there are more than one possible. One rule that we discussed was to increase the variable with the biggest coeificient. However, for this linear program, it is better to use a different rule, where you should increase the variable that causes the greatest resulting increase in the objective function. If you use this rule, then after only one iteration, you will find the optimal solution. This should help you avoid a long sequence of iterations with nasty numbers ) MAXWLQDXV LOX; 351(‘17‘? ":1 , “(.4le + x1 M181 , ”View. $525., LYIQQng, )(Ll/ an 52.12): (DID: 0) 0} MM" 0) ”ll-:ficieeé r. hue-muse; it has 9min critical 6h :7. (ll coiisimms 5H J» \i nil m} L17 Leneimmg yig( ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online