A company produces two types of bicycles; mountain bikes and racing bikes. It takes 3 hours of assembly time and 6 hours of mechanical tuning to produce a mountain bike. It takes 8 hours of assembly time and 4 hours of mechanical tuning to produce a racing bike. The company has at most 28 hours of mechanical tuning labor per week and at most 173 hours of assembly labor per week. The company's profit is $70 for each mountain bike produced and $170 for each racing bike produced. The company wants to maximize their profit. Let x = the number of mountain bikes they produce, and let y = the number of racing bikes they produce. Set up the linear programming problem. a) Maximize P = 170 x + 70 y, subject to 3 x + 8 y ? 173, 6 x + 4 y ? 28, x ? 0, y ? 0 b) Maximize P = 1190 x y, subject to 3 x + 6 y ? 173, 8 x + 4 y ? 28, x ? 0, y ? 0 c) Maximize P = 70 x + 170 y, subject to 3 x + 8 y ? 173, 6 x + 4 y ? 28, x ? 0, y ? 0 d) Minimize P = 170 x + 70 y, subject to 6 x + 8 y ? 173, 3 x + 4 y ? 28, x ? 0, y ? 0 e) Minimize P = 70 x + 170 y, subject to 3 x + 8 y ? 173, 6 x + 4 y ? 28, x ? 0, y ? 0 f) None of the above.
Added by Amy B.
Close
Step 1
x=20 Show more…
Show all steps
Your feedback will help us improve your experience
Supreeta N and 97 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
I am stuck with this optimization problem.
Jason H.
Susanna Nanna is the production manager for a furniture manufacturing company. The company produces tables (X) and chairs (Y). Each table generates a profit of $80 and requires 3 hours of assembly time and 4 hours of finishing time. Each chair generates $50 of profit and requires 3 hours of assembly time and 2 hours of finishing time. There are 360 hours of assembly time and 240 hours of finishing time available each month. The following linear programming problem represents this situation: Maximize 80X + 50Y Subject to: 3X + 3Y ≤ 360 4X + 2Y ≤ 240 X, Y ≥ 0 The optimal solution is X = 0, and Y = 120. (a) What would the maximum possible profit be? (b) How many hours of assembly time would be used to maximize profit? (c) If a new constraint, 2X + 2Y ≤ 400, were added, what would happen to the maximum possible profit?
Karan D.
A bicycle manufacturing company makes a particular type of bike. Each child bike requires 4 hours to build and 4 hours to test. Each adult bike requires 6 hours to build and 4 hours to test. With the number of workers, the company is able to have up to 120 hours of building time and 100 hours of testing time for a week. If c represents child bikes and a represents adult bikes, can the company build 20 child bikes and 6 adult bikes in a week. (2 points) No, because the bike order does not meet the restrictions of 4c + 6a ≤ 120 and 4c + 4a ≤ 100 No, because the bike order does not meet the restrictions of 4c + 4a ≤ 120 and 6c + 4a ≤ 100 Yes, because the bike order meets the restrictions of 4c + 6a ≤ 120 and 4c + 4a ≤ 100 Yes, because the bike order meets the restrictions of 4c + 4a ≤ 120 and 6c + 4a ≤ 100
Georgiann A.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD