MIE376 Lec 2 - Simplex.page35

MIE376 Lec 2 - Simplex.page35 - 2 ≤ 7 ² x 1 ≥ ² x 2...

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

View Full Document Right Arrow Icon
MIE376 - Mathematical Programmingt 35 Unbounded solutions ± Suppose the LP formulation contains errors ² Maximize z = x 1 + 2*x 2 ² subject to the “constraints” ² x 1 3*x 2 16 ² x 1 x
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2 ≤ 7 ² x 1 ≥ ² x 2 ≥ ± Clearly from the graph the solution is unbounded ± How is this detected in the simplex algorithm? x 4 x 4 x 1 x 3 x 2...
View Full Document

This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto.

Ask a homework question - tutors are online