Unformatted text preview: (35) Solve the following linear program, using the simplex method. You should ﬁrst 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 ﬁnding 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 coeiﬁcient. 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 ﬁnd 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:ﬁcieeé r. huemuse; it has 9min critical 6h :7. (ll coiisimms 5H J» \i nil m}
L17 Leneimmg yig( ...
View
Full Document
 Fall '09
 TROTTER

Click to edit the document details