Question: Consider the following linear optimization problem: minimize x,y,z subject to x+y+z 2x - 3y + 1.5z > 2 x + 2y -z = 3

Consider the following linear optimization problem: minimize x,y,z subject to x+y+z 2x - 3y + 1.5z > 2 x + 2y -z = 3 1 x 4, 1 z 3. y 1.5, a) Use linprog to solve this problem. Make sure to identify x, y, z*, and obj* = x +y* +y*. b) Which constraints are binding and which constraints are not binding at the optimal solution?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
