LP Practice Answers [PDF]

Zitiervorschau

LP Practice Question The Puck and Pawn Company manufactures hockey sticks and chess sets. Each hockey stick yields an incremental profit of $2, and each chess set, $4. A hockey stick requires four hours of processing at Machine Center X, and two hours at Machine Center Y. A chess set requires six hours at Machine Center X, six hours at Machine Center Y, and one hour at Machine Center Z. Machine Center X has a maximum of 120 hours of available capacity per day, Machine Center Y has 72 hours and Machine Center Z has 10 hours. The company would like to determine how many hockey sticks and how many chess sets to produce in order to maximize their overall profit. A linear programming formulation for this problem is shown below, along with a graph of the constraints. Maximize Z = 2H + 4C Subject to: Machine Center X Machine Center Y Machine Center Z

4H + 6C