Explore BrainMass

Explore BrainMass

    Linear programming problem solving

    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!

    1. Solve the linear programming problem:

    minimize z = x + y
    subject to
    x + 2y =< 40,
    2x + y =<40,
    x + y =<10,
    x >= 0, y >=0

    The corner points are: (0, 10), (0, 20), (40/3, 40/3) (20, 0), (10, 0).

    © BrainMass Inc. brainmass.com March 4, 2021, 6:13 pm ad1c9bdddf
    https://brainmass.com/math/linear-programming/linear-programming-problem-solving-35771

    Solution Summary

    Solves a Linear programming problem.

    $2.49

    ADVERTISEMENT