Rework problem 14 in section 1 of Chapter 7 of your textbook, about the Mount Cycle Company, using the following data. Assume that the amounts of time (in minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following table: Frame Wheels Decoration Starstreak 22 17 Superstreak 16 12 13 Assume also that each day the company has available 125 hours of labor for assembling frames, 85 hours of labor for installing wheels, and 135 hours of labor for decoration. Assume also that the profit on each Starstreak bike is $21.00 and the profit on each Superstreak bike is $27.00. How many bikes of each type should the company make in order maximize its profit? When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how many objective functions should you have? Number of variables: 2 Number of constraints: 5 Number of objective functions: 1 • Part 2 - Part 3 Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <= wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., 2.) Maximize 21 x+ 27 subject to the constraints >= >3= labor spent on assembling frames (in minutes): 22 x + 16 <= labor spent on installing wheels (in minutes): x + 12 <= labor spent on decorating (in minutes): 17 x + 13 <=
Rework problem 14 in section 1 of Chapter 7 of your textbook, about the Mount Cycle Company, using the following data. Assume that the amounts of time (in minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following table: Frame Wheels Decoration Starstreak 22 17 Superstreak 16 12 13 Assume also that each day the company has available 125 hours of labor for assembling frames, 85 hours of labor for installing wheels, and 135 hours of labor for decoration. Assume also that the profit on each Starstreak bike is $21.00 and the profit on each Superstreak bike is $27.00. How many bikes of each type should the company make in order maximize its profit? When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how many objective functions should you have? Number of variables: 2 Number of constraints: 5 Number of objective functions: 1 • Part 2 - Part 3 Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <= wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., 2.) Maximize 21 x+ 27 subject to the constraints >= >3= labor spent on assembling frames (in minutes): 22 x + 16 <= labor spent on installing wheels (in minutes): x + 12 <= labor spent on decorating (in minutes): 17 x + 13 <=
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter7: Analytic Trigonometry
Section7.6: The Inverse Trigonometric Functions
Problem 94E
Related questions
Concept explainers
Continuous Probability Distributions
Probability distributions are of two types, which are continuous probability distributions and discrete probability distributions. A continuous probability distribution contains an infinite number of values. For example, if time is infinite: you could count from 0 to a trillion seconds, billion seconds, so on indefinitely. A discrete probability distribution consists of only a countable set of possible values.
Normal Distribution
Suppose we had to design a bathroom weighing scale, how would we decide what should be the range of the weighing machine? Would we take the highest recorded human weight in history and use that as the upper limit for our weighing scale? This may not be a great idea as the sensitivity of the scale would get reduced if the range is too large. At the same time, if we keep the upper limit too low, it may not be usable for a large percentage of the population!
Question
Transcribed Image Text:• Part 1
Rework problem 14 in section 1 of Chapter 7 of your textbook, about the Mount Cycle Company, using the following data. Assume that the amounts of time (in
minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following
table:
Frame Wheels Decoration
Starstreak
22
17
Superstreak 16
12
13
Assume also that each day the company has available 125 hours of labor for assembling frames, 85 hours of labor for installing wheels, and 135 hours of
labor for decoration. Assume also that the profit on each Starstreak bike is $21.00 and the profit on each Superstreak bike is $27.00. How many bikes of each
type should the company make in order maximize its profit?
When you formulate a linear programming problem to solve this problem, how many variables, how many constraints (both implicit and explicit), and how
many objective functions should you have?
Number of variables: 2
Number of constraints: 5
Number of objective functions:
1
• Part 2
• Part 3
Formulate the linear programming problem for this situation. (Enter either the word Maximize or the word Minimize in the first blank. Type the symbols <=
wherever you want a "less than or equal" inequality, i.e., <, and type the symbols >= wherever you what a "greater than or equal" inequality, i.e., >.)
Maximize
21
x+ 27
subject to the constraints
>=
labor spent on assembling frames (in minutes):
22
x +
16
labor spent on installing wheels (in minutes):
x +
12
labor spent on decorating (in minutes):
17
x +
13
నా
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Functions and Change: A Modeling Approach to Coll…
Algebra
ISBN:
9781337111348
Author:
Bruce Crauder, Benny Evans, Alan Noell
Publisher:
Cengage Learning