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 900 labor-hours of fabrication time and 700 labor-hours of assembly time available per week. The profit on each component, A, B, and C, is $7, 58, 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 x₁, x₂, and x3 be the numbers Maximize P= subject to f components A, B, and C, respectively, that get manufactured. Construct a mathematical model in the form of a linear programming problem. Fabrication time restriction Assembly time restriction x₁, x₂, X3 20 The company should manufacture component As. component Bs, and component Cs to maximize their profit at S (Simplify your answers.)

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
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 900 labor-hours of fabrication time and 700 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 x₁, 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
X1, X₂, X3 20
The company should manufacture
(Simplify your answers.)
Fabrication time restriction
Assembly time restriction
component As,
component Bs, and
C
component Cs to maximize their profit at $
Transcribed Image Text: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 900 labor-hours of fabrication time and 700 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 x₁, 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 X1, X₂, X3 20 The company should manufacture (Simplify your answers.) Fabrication time restriction Assembly time restriction component As, component Bs, and C component Cs to maximize their profit at $
Expert Solution
steps

Step by step

Solved in 7 steps with 4 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,