Explore BrainMass

Explore BrainMass

    Linear programming problem: Minimization

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

    Consider the following minimization problem.

    Min z = 1.5x1 + 2x2
    s.t. x1 + x2 300
    2x1 + x2 400
    2x1 + 5x2 750
    x1, x2 0

    What are the optimal values of x1, x2, and z?

    © BrainMass Inc. brainmass.com October 1, 2020, 6:26 pm ad1c9bdddf

    Solution Preview

    Please find attached solution to your problem. The constraints (<or>) ...

    Solution Summary

    This solution provides details on how to solve a minimization problem for a linear programming situation.