Explore BrainMass

Explore BrainMass

    Linear Programming : Maximizing Profit

    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!

    I am doing a linear programming model and need to graph on a grid line and I have the constraints, but do not know how to do the alegra part:

    45c + 30b= 180
    3c + 8b = 20
    (c, b < or equal to 0)

    Max profit = 10c + 6b

    I can not solve for the variables c and b. The answers are in the back of the book (4,0) but I don't know how to do it.

    © BrainMass Inc. brainmass.com March 4, 2021, 8:27 pm ad1c9bdddf

    Solution Preview

    I believe your condition is wrong due to your answer (4,0).
    The constraints should be:
    45c + 30b <= 180
    3c + 8b <=20
    b >=0
    c >=0
    So we need to find the feasible region.
    Solve the ...

    Solution Summary

    Linear programming is examined for maximizing profits on grid lines.