A factory manufactures three products, A, B, and C. Each product requires the use of two machines, Machine I and Machine II. The total hours available, respectively, on Machine I and Machine Il per month are 7,760 and 10,080. The time requirements and profit per unit for each product are listed below. A B C Machine I 7 9 10 Machine II 8 10 16 $12 $16 $22 Profit How many units of each product should be manufactured to maximize profit, and what is the maximum profit? Start by setting up the linear programming problem, with A, B, and C representing the number of units of each product that are produced. Maximize P = subject to: <7,760 < 10,080 Enter the solution below. If needed round numbers of items to 1 decimal place and profit to 2 decimal places. The maximum profit is $ when the company produces: units of product A units of product B units of product c

A factory manufactures three products, A, B, and C. Each product requires the use of two machines, Machine I and Machine II. The total hours available, respectively, on Machine I and Machine Il per month are 7,760 and 10,080. The time requirements and profit per unit for each product are listed below. A B C Machine I 7 9 10 Machine II 8 10 16 $12 $16 $22 Profit How many units of each product should be manufactured to maximize profit, and what is the maximum profit? Start by setting up the linear programming problem, with A, B, and C representing the number of units of each product that are produced. Maximize P = subject to: <7,760 < 10,080 Enter the solution below. If needed round numbers of items to 1 decimal place and profit to 2 decimal places. The maximum profit is $ when the company produces: units of product A units of product B units of product c

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter2: Systems Of Linear Equations

Section2.4: Applications

Problem 27EQ

See similar textbooks