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
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!
![• 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
6.
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.)
x+
subject to the constraints
labor spent on assembling frames (in minutes):
x +
labor spent on installing wheels (in minutes):
x +
labor spent on decorating (in minutes):
出
出](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4804c7e2-0449-4e9d-b060-ae2abfeacec8%2F0f1e6375-0f31-4f6d-8bd1-08bd1cba885b%2Fjt4lcag_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)