Answer:
i would pick 700.
Step-by-step explanation:
but im not sure this seems hard.
Answer:
Following are the solution to the given equation:
Step-by-step explanation:
The graph file and correct question are defined in the attachment please find it.
According to the linear programming principle, we predict, that towards the intersections of the constraint points in the viability area, and its optimal solution exists. The sketch shows the points that are (0,16), (3,1), and (6,0).
by putting each point value into the objective function:
Thus, the objective of the function is reduced with a value of 183 at (3,1).
Answer:
k is the ans i think
soryy if im woggy
Step-by-step explanation:
265,888 rounded to the nearest ten thousand is 70,000.
distance = rate * time.
distance is number of miles the car has traveled.
rate = number of miles per hour the car is traveling at.
time = number of hours the car has been driven.
let D = distance.
let T = time.
let R = rate
the general equation is D = R*T
as long as the car will always be driven at 55 miles per hour, you can substitute 55 for R and that becomes your constant.
The equation then becomes D = 55 * T.
example:
you drive 5 hours.
D = 55 * T = 55 * 5 = 275 miles.
If you drive at 55 miles per hour for 5 hours, you will have driven 275 miles.
Hope this helps!
