Question of 67
Q.A manufacturer produces two types of steel trunk. He has two machines, and . The first type of trunk requires 3 hours on machine and 3 hours on machine . The second type of trunk requires 3 hours on machine and 2 hours on machine . Machines and can work at most for 18 hours and 15 hours per day respectively. He earns a profit of ₹30 and ₹25 per trunk of the first type and second type respectively. How many trunks of each type must he make each day to make the maximum profit? OR If a young man rides his motorcycle at 25 km per hour, he has to spend ₹2 per km on petrol. If he rides it at a faster speed of 40 km per hour, the petrol cost increases to ₹5 per km. He has ₹100 to spend on petrol and wishes to find the maximum distance he can travel within one hour. Express this as a linear programming problem and then solve it.
Meghalaya MboseMBOSE Meghalaya Intermediate Board 2021Subjective· 6mImportance★★★★★
0% · 0/67 Questions
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 →Set up the constraints, list the corner points of the feasible region, and evaluate the objective at each.
Let = number of first-type trunks, = number of second-type trunks.
Constraints. Machine : . Machine : . Also .
Objective. Maximise .
Corner points of the feasible region:
- .
- -axis: (and ), so .
- -axis: (and ), so .
- Intersection of and : from , , giving .
Evaluate :
Maximum is at .
…
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.