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 950 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= 7x₁ +8x2 +10x3 subject to 2x₁ + 3x₂ + 2x3 ≤ 950 X₁+x₂+2x3 700 C Fabrication time restriction Assembly time restriction

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 3SC: In Example 3, if the accountant earns a profit of 100 on each individual return and a profit of 175...
icon
Related questions
Question
anges
3:
Worked
ent Scor
empts:
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 950 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?
Question
Question
Question
Question
Review
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.
This course (MATH
Maximize P = 7x₁ + 8x2 +10x3
2x₁ + 3x₂ + 2x3 ≤ 950
700
subject to
x₁ + x₂+2x3
X₁, X₂, X3 20
The company should manufacture
(Simplify your answers.)
Help me solve this
Fabrication time restriction
Assembly time restriction
component As, component Bs, and component Cs to maximize their profit at S
Video Get more help.
Clear all
Check answer
Transcribed Image Text:anges 3: Worked ent Scor empts: 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 950 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? Question Question Question Question Review 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. This course (MATH Maximize P = 7x₁ + 8x2 +10x3 2x₁ + 3x₂ + 2x3 ≤ 950 700 subject to x₁ + x₂+2x3 X₁, X₂, X3 20 The company should manufacture (Simplify your answers.) Help me solve this Fabrication time restriction Assembly time restriction component As, component Bs, and component Cs to maximize their profit at S Video Get more help. Clear all Check answer
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning