Question

Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than

\[3\frac{1}{2}\] hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than 

\[2\frac{1}{2}\]  hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.

 

Answer 1

Let Amit correctly solves x problems from the first set, y problems from the second set and z problems from the third set.
Given,
Amit cannot submit more than 100 correctly solved problems.

\[\therefore x + y + z \leq 100\]

The problem in the first set are worth 5 points each,those in the second set worth 4 points each and those in the third set worth 6 points each.
Therefore, x problems from the first set worth 5x points, y problems from the second set worth 4y points and z problems from the third set worth 6z points.
Thus, total credit points will be

\[5x + 4y + 6z\] 

Let Z denotes the total credit of Amit 

\[\therefore Z = 5x + 4y + 6z\]

It requires 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem and 4 minutes to solve a 6 point problem.Therefore,x problems from the first set require 3x minutes, y problems from the second set require 2y minutes and zproblems from the third set require 4z minutes.
Thus, the total time require by Amit will be (3x + 2y + 4z) minutes.
It is given that the total time that Amit can devote on his mathematics assignment is \[3\frac{1}{2} \text{ hours i . e . 210 minutes } .\]

\[\therefore 3x + 2y + 4z \leq 210\] 
Further, it is given that the total time that Amit can devote in solving first two types of problems cannot be more than

\[2\frac{1}{2}\] hours i.e 150 minutes

\[\therefore 3x + 2y \leq 150\]

Number of problems cannot be negative.Therefore,

\[x, y \geq 0\] 

Hence, the required LPP is follows:
Maximize

\[Z = 5x + 4y + 6z\]

subject to 

\[x + y + z \leq 100\]
\[3x + 2y + 4z \leq 210\]
\[ 3x + 2y \leq 150\]
\[x \geq 0, y \geq 0\]