Mathematics - Extra Topics Question with Solution | TestHub

MathematicsExtra TopicsExtra TopicsEasy2 minPYQ_2026
MathematicsEasysingle choice

A company sells two types of notebooks, A and B. Each notebook requires two processes: printing and binding. Notebook A requires minutes for printing and minute for binding. Notebook B requires minutes for printing and minutes for binding. The company can spend hours on printing and hours on binding. If the profit made on notebooks A and B is Rs. and Rs. respectively, then the Linear Programming Problem (LPP) to maximize the total profit is ...

Options:

Answer:
C
Solution:

Let be the number of notebooks of type A and be the number of notebooks of type B.

The objective is to maximize the total profit . Since the profit on notebook A is Rs. and on notebook B is Rs. , the objective function is:

Maximize

The time required for printing notebook A is minutes and for notebook B is minutes. The maximum time available for printing is hours, which is minutes. This gives the printing constraint:



The time required for binding notebook A is minute and for notebook B is minutes. The maximum time available for binding is hours, which is minutes. This gives the binding constraint:



Since the number of notebooks cannot be negative, we have the non-negativity constraints:



Combining all these, the LPP is to maximize subject to , , , .

Answer: maximize subject to

Stream:MHT_CETSubject:MathematicsTopic:Extra TopicsSubtopic:Extra Topics
⏱ 2mℹ️ Source: PYQ_2026

Doubts & Discussion

Loading discussions...