Start a conversation with me and you get 100 points :D
2 answers:
You might be interested in
9514 1404 393
Answer:
C. 0.98
Step-by-step explanation:
The attached graph shows the constraints. The feasible solution space is the doubly-shaded area in the first quadrant. The negative coefficients on x and y suggest that the objective function will be maximized when x and y are minimized. The solution space vertex that does that is ...
(x, y, Y) = (6, 4, 0.98)
Answer:
- Levi
- Christopher
- Roberto
Step-by-step explanation:
I like to work problems involving repetitive calculations using a spreadsheet. The sort function can easily put the results in the appropriate order.
__
Here, we need to compute minutes and kilometers remaining for each cyclist, and then divide the former by the latter to find the required timing.
Minutes remaining will be the difference between the qualifying time and the time used so far.
Km remaining will be the difference between the race length and the distance traveled so far.
Required minutes per km will be the ratio of minutes remaining to km remaining.
Levi has the least allowed minutes per km for his remaining distance. Roberto has the most.
_____
Christopher only has to increase his average speed by about 5% in order to qualify; Levi has the greatest challenge, as he needs about 18% more speed for the rest of the race.
