Applying Linear Programming Techniques: The Graphic Method: The Hale Company manufactures product A and product B, each of which requires two processes, polishing and grinding. The contribution margin is $3 for product A and $4 for product B. The graph shows the maximum number of units of each product that may be processed in the two departments.

Required: Considering the constraints on processing, which combination of product A and product B maximizes the total contribution?

Transcribed Image Text:

Units of Product B 40 30 20 20 10 10 Polishing constraint (restriction) Feasible production region Grinding constraint (restriction) 0 10 20 30 40 40 Units of Product A