Linear Programming and Simplex Methods : Minimization
The linear programming problem. Minimize 5x - y subject to: -2x - 2y < 12 -3x + 2y > 0 x > 0, y > 0 is equivalent to the linear programming problem: a. Maximize 5x - y subject to: -2x -2y < 12 3x - 2y < 0 x > 0, y > 0 b. Maximize 5x-y subject to: -2x -2y < 12 -3x + 2y > 0 x >