# Linear Programming and Simplex Methods : Minimization

Not what you're looking for? Search our solutions OR ask your own Custom question.

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 > 0, y > 0

c. Maximize 5x -y subject to : ]

-2x -2y < 12

-3x + 2y < 0

x > 0, y > 0

d. Maximize 5x-y subject to:

-2x -2y < 12

3x + 2y > 0

x > 0, y > 0

e. None of the above

Â© BrainMass Inc. brainmass.com March 4, 2021, 6:26 pm ad1c9bdddfhttps://brainmass.com/math/linear-programming/linear-programming-simplex-methods-minimization-44981

#### Solution Summary

Minimization is investigated.

$2.49