Skip to content
Question of 67

Q.A manufacturer produces two types of steel trunk. He has two machines, AA and BB. The first type of trunk requires 3 hours on machine AA and 3 hours on machine BB. The second type of trunk requires 3 hours on machine AA and 2 hours on machine BB. Machines AA and BB 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
🔒 Locked · start free trial →

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 xx = number of first-type trunks, yy = number of second-type trunks.

Constraints. Machine AA: 3x+3y≤18⇒x+y≤63x+3y\le18\Rightarrow x+y\le6. Machine BB: 3x+2y≤153x+2y\le15. Also x,y≥0x,y\ge0.

Objective. Maximise Z=30x+25yZ=30x+25y.

Corner points of the feasible region:

  • (0,0)(0,0).
  • xx-axis: 3x≤15⇒x≤53x\le15\Rightarrow x\le5 (and x≤6x\le6), so (5,0)(5,0).
  • yy-axis: y≤6y\le6 (and 2y≤15⇒y≤7.52y\le15\Rightarrow y\le7.5), so (0,6)(0,6).
  • Intersection of x+y=6x+y=6 and 3x+2y=153x+2y=15: from y=6−xy=6-x, 3x+2(6−x)=15⇒x=3, y=33x+2(6-x)=15\Rightarrow x=3,\ y=3, giving (3,3)(3,3).

Evaluate ZZ:

Z(0,0)=0,Z(5,0)=150,Z(3,3)=90+75=165,Z(0,6)=150.Z(0,0)=0,\quad Z(5,0)=150,\quad Z(3,3)=90+75=165,\quad Z(0,6)=150.

Maximum is at (3,3)(3,3).

…

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.