Lecture 9: Linear Programming
Lecture 9: Linear Programming
Lecture 9: Linear Programming
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Solution via the simplex method<br />
This yields x 1 = 2 – 6x 2 + x 3<br />
x 4 = 8 + 3x 2 –4x 3<br />
which we substitute into the objective<br />
function to obtain the latter in terms of<br />
right hand variables<br />
z = 2x 2 –4x 3<br />
There are M left hand variables and N – M<br />
right hand variables<br />
203
Change language