Refer to Exercise 15. Determine the maximum distance that the man can travel.
When we refer to the Exercise, we get the following information:
If the man rides his motorcycle for a distance of x km at a speed of 50km/hr then he has to spend Rs. 2/km on petrol.
And if he rides his motorcycle for a distance of y km at a speed of 80 km/hr then he has to spend Rs. 3/km on petrol.
He has Rs.120 to spend on petrol for covering the total distance so the constraint becomes
2x+3y≤120…………(i)
Given that he has only one hour’s time to cover the total distance, then the constraint becomes
{as distance speed x time}
Now taking the LCM as 400, we get
And [non-negative constraint]
He want to find out the maximum distance travelled, here total distance,
Now, we have to maximize the distance, i.e., maximize
So, to maximize distance we have to maximize, ,$ subject to
When we convert it into equation we get
The region that is represented by 2x+3y≤120:
The line that is 2x+3y=120 further meets the coordinate axes (60,0) and (0,40) respectively and then when we will join these points we obtain the line 2x+3y=120. It is clear that (0,0) justifies the inequation 2x+3y≤120. So the region that contain the origin represents the solution set of the inequation 2x+3y≤120
The region represented by 8x+5y≤400:
We can see that the line 8x+5y=400 meets the coordinate axes (50,0) and (0,80) respectively. When we join these points we obtain the line 8x+5y=400. Therefore, it is clear that (0,0) satisfies the inequation 8x+5y≤400. So the region that contain the origin represents the solution set of the inequation 8x+5y≤400
The first quadrant of the region represented is x≥0 and y≥0. The graph is as follows:
The shaded region OBCD is the feasible region is bounded, and maximum value will occur at a corner point of the feasible region.
Corner Points are
When we substitute the values in Z, we get the following answer:
So from the above table the maximum value of Z is at point
Hence, the maximum distance the man can travel is or 54.3 km