Q.A man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has at most Rs 120 to spend on petrol and one hour's time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →Let and be the distances (in km) ridden at 50 km/h and 80 km/h. With a petrol budget of Rs 120 and a time limit of 1 hour, the LPP is: Maximise subject to , , .
Setting up the model
The man can ride part of the way at 50 km/h and part at 80 km/h. Each speed uses two limited resources — money (petrol) and time — and he wants the greatest total distance. That is a linear programming problem: two decision variables, two linear constraints, and a linear objective.
1. Decision variables.
Let = distance (km) ridden at 50 km/h and = distance (km) ridden at 80 km/h, with , .
2. Objective function.
Total distance is , to be maximised: Maximise .
3. Petrol-cost constraint.
At 50 km/h petrol costs Rs 2 per km, so km costs ; at 80 km/h it costs Rs 3 per km, so km costs . Total cost is at most Rs 120:
4. Time constraint.
Time = distance divided by speed, so the two legs take and hours. Total time is at most 1 hour:
…
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.