Lecture 9: Linear Programming

Solution via the simplex method
Setting the RH variables equal to zero, we can immediately
obtain a basic feasible vector (but not, in general, the
optimal one) x = (+2, 0, 0, +8)
Increasing x 3 from zero will clearly decrease z, so we
conclude that the optimal feasible vector must have x 3 = 0
const
x 2 x 3
z 0 + 2 –4
x 1 + 2 –6 + 1
x 4 + 8 + 3 –2
205