Explore BrainMass
Share

Explore BrainMass

    Linear programming: The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.

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

    The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.

    Max 2x1 + x2

    s.t. 4x1 + 1x2 < 400

    4x1 + 3x2 < 600

    1x1 + 2x2 £ 300

    x1 , x2 > 0

    Compute the dual prices for the three constraints.

    .45, .25, 0
    .25, .25, 0
    0, .25, .45
    .45, .25, .25

    © BrainMass Inc. brainmass.com October 9, 2019, 8:13 pm ad1c9bdddf
    https://brainmass.com/math/linear-programming/143774

    Solution Summary

    The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.

    $2.19