Explore BrainMass

Explore BrainMass

    Maximize a linear objective function with constraints

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

    Maximize the objective function 2x + 3y subject to the constraints that x + twice y is at most 6; and the sum of 5 times x and 3 times y is at most 15; with both decision variables non-negative.

    Find the optimal solution using linear programming and the graphical solution procedure. What is the value of the objective function at the optimal solution?

    Show all work in detail.

    © BrainMass Inc. brainmass.com June 4, 2020, 12:03 am ad1c9bdddf

    Solution Summary

    The solution is a PDF with an additional image of the feasible region with cross-hatching.