Explore BrainMass

Explore BrainMass

    Linear Programming and Simplex Methods : Minimization

    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!

    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-simplex-methods-minimization-44981

    Attachments

    Solution Summary

    Minimization is investigated.

    $2.49

    ADVERTISEMENT