Formulate the LP problem and solve graphically using the Objective Function Line Method.

JAM, Inc. is a small manufacturer of sports and school bags. Its distributor believes that a market exists for both medium-priced school bags, Product A, and high-priced sports bags, Product B. The distributor is so confident of the market that, if JAM can make the bags at a competitive price, the distributor will purchase all the bags that it can manufacture over the next three months. A careful analysis of the manufacturing requirements resulted in the following table, which shows the production time requirements for the four required manufacturing operations and the accounting department’s estimate of the profit contribution per bag:

The director of manufacturing estimates that 630 hours of cutting and dyeing time, 600 hours of sewing time, 708 hours of finishing time, and 135 hours of inspection and packaging time will be available for the production of sports and school bags during the next three months. How many bags of each model should it manufacture?

  

Transcribed Image Text:

Product Product A Product B Cutting and dyeing 7/10 1 Production time in hours Sewing 1/2 5/6 Finishing 1 2/3 Inspection and Packaging 1/10 de ½ Profit per bag P200 P180 Product Product A Product B Cutting and dyeing 7/10 1 Production time in hours Sewing 1/2 5/6 Finishing 1 2/3 Inspection and Packaging 1/10 de ½ Profit per bag P200 P180

Answer rating: 100% (QA)

The Linear Programming LP problem presented in this case involves the maximization of profit for JAM Inc a small manufacturer of sports and school bag... View the full answer