= Homework: MLM 4 Part 1 of 2 A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; component B requires...


= Homework: MLM 4<br>Part 1 of 2<br>A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; component<br>B requires 3 hours of fabrication and 1 hour of assembly; and component C requires 2 hours of fabrication and 2 hours of assembly. The company has up to 1,150<br>labor-hours of fabrication time and 1,000 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, $8, and $10, respectively.<br>How many components of each type should the company manufacture each week in order to maximize its profit (assuming that all components manufactured can be<br>sold)? What is the maximum profit?<br>.....<br>Let x1, X2, and X3 be the numbers of components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linear<br>programming problem.<br>Maximize P=<br>subject to<br>Fabrication time restriction<br>Assembly time restriction<br>X1, X2, X3 20<br>VI<br>

Extracted text: = Homework: MLM 4 Part 1 of 2 A small company manufactures three different electronic components for computers. Component A requires 2 hours of fabrication and 1 hour of assembly; component B requires 3 hours of fabrication and 1 hour of assembly; and component C requires 2 hours of fabrication and 2 hours of assembly. The company has up to 1,150 labor-hours of fabrication time and 1,000 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, $8, and $10, respectively. How many components of each type should the company manufacture each week in order to maximize its profit (assuming that all components manufactured can be sold)? What is the maximum profit? ..... Let x1, X2, and X3 be the numbers of components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linear programming problem. Maximize P= subject to Fabrication time restriction Assembly time restriction X1, X2, X3 20 VI

Jun 04, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here