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 940, 1240, and 830, respectively. The time requirements (in hours per unit) and profit per unit for each 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 AProduct B Product C Dept. I Dept. II Dept. III 2 2 Profit $16 $10 $15 Maximize subject to the constraints department I department II department III

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 940, 1240, and 830, respectively. The time requirements (in hours per unit) and profit per unit for each 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 AProduct B Product C Dept. I Dept. II Dept. III 2 2 Profit $16 $10 $15 Maximize subject to the constraints department I department II department III

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter2: Systems Of Linear Equations

Section2.4: Applications

Problem 23EQ: 23. Consider a simple economy with just two industries: farming and manufacturing. Farming consumes...

See similar textbooks