Formulate but do not solve the following exercise as a linear programming proble

Question

Formulate but do not solve the following exercise as a linear programming problem. A company manufactures x units of product A, y units of product B, and z units of product C. Each product is processed in three departments: I, II, and III. The total available labor-hours per week for departments I, II, and III is 950, 1920, and 850, respectively. The time requirements (in hours per unit) and profit per unit for eadh product are given in the table below. How many units of each product should the company produce in order to maximize its profit, p Product A Product B Product C Dept. I2 Dept. II Dept. III Profit t$16 $10 $14 subject to the constraints x 20

Explanation / Answer

P = 16x + 10y + 14z

subject to:

Dept 1

2x + 3y + 2z 950

Dept 2:

x + y + 2z 1920

Dept 3:

2x + 2y + z 850

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---