Explore BrainMass

# Linear Programming and Simplex Methods

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

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

See attach for problem.

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 ad1c9bdddf
https://brainmass.com/math/linear-programming/linear-programming-and-simplex-methods-45017

#### Solution Summary

This solution is comprised of a detailed explanation to answer which is equivalent to the linear programming problem.

\$2.49