This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: gramming problem, using only linear constraints? (b) Suppose instead feasible solutions must satisfy the extra condition  x 3 + 2 x 4  ≤ 5 . How could you incorporate this condition into your linear programming problem, using only linear constraints? (c) Suppose instead you wish to change your objective to maximizing the function min { x 1 , 4 x 2 } . How could you model the new problem as a linear programming problem? ( Hint: introduce a new variable as the objective; then add suitable constraints restricting its value.) (d) Suppose instead feasible solutions must satisfy the extra condition max { 3 x 1 , x 2 } ≥ 6 . Do you think it is possible, in general, to incorporate this condition using only linear constraints? ( Hint : what geometric properties do feasible regions of linear programming problems have?) 2...
View
Full Document
 '08
 TODD
 Operations Research, Linear Programming, Optimization, linear programming problem, Simplex algorithm

Click to edit the document details