Explore BrainMass

Explore BrainMass

    Constraint in a linear programming problem

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

    Cully furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. Which of the following is not a feasible purchase combination?
    150 big shelves and 0 medium shelves
    0 big shelves and 200 medium shelves
    100 big shelves and 100 medium shelves
    100 big shelves and 0 medium shelves
    100 big shelves and 82 medium shelves

    © BrainMass Inc. brainmass.com June 3, 2020, 8:29 pm ad1c9bdddf

    Solution Preview

    We can form the following linear programming.

    Maximize Z=300B+150M

    Subject to


    Solution Summary

    This solution contains a detailed explanation of how to identify a constraint in a linear programming problem.