Linear programming is one of the most powerful tools for making optimal decisions under real-world constraints — and Example 5 of NCERT Class 12 Appendix 2 shows exactly how it fits inside the mathematical modelling framework. A medicine manufacturer needs to decide how many bottles of two medicines to produce to maximise profit, subject to limits on raw materials, available bottles, and production time.
Understanding how the five-step modelling framework structures this LP problem is the key insight the chapter is building toward.
The Problem Statement (Step 1)
A manufacturer plans to produce two medicines, M₁ and M₂. The physical constraints are:
-
Raw materials are sufficient to produce at most 20,000 bottles of M₁ and 40,000 bottles of M₂.
-
There are only 45,000 bottles available in total, shared between both medicines.
-
Preparing material for 1,000 bottles of M₁ takes 3 hours; for M₂ it takes 1 hour.
-
Total production time available is 66 hours.
-
Profit per bottle is ₹8 for M₁ and ₹7 for M₂.
Goal: Determine how many bottles of each medicine to produce in order to maximise total profit.
Setting Up the Mathematical Model (Step 2)
Let x = number of bottles of M₁ and y = number of bottles of M₂.
Objective function (to be maximised):
Z = 8x + 7y
Constraints (translating each physical limit into a mathematical inequality):
-
x ≤ 20,000 — raw material limit for M₁
-
y ≤ 40,000 — raw material limit for M₂
-
x + y ≤ 45,000 — total bottle availability
-
3x + y ≤ 66,000 — total production time (hours × 1000 bottles)
-
x ≥ 0, y ≥ 0 — non-negativity
Each constraint arises directly from a specific physical fact about the production process. This is precisely what Step 2 of the modelling framework requires: converting physical limits into mathematical inequalities before any calculation begins.
Finding the Optimal Solution (Step 3)
The feasible region satisfying all five constraints forms a hexagonal polygon called OPQRST. By the corner-point method (from Chapter 12 of NCERT), the maximum value of a linear objective function always occurs at one of the vertices of the feasible region.
The six vertices and their Z values are:
| Vertex | Coordinates | Z = 8x + 7y |
|---|---|---|
| O | (0, 0) | ₹0 |
| P | (20,000, 0) | ₹1,60,000 |
| Q | (20,000, 6,000) | ₹2,02,000 |
| R | (10,500, 34,500) | ₹3,25,500 |
| S | (5,000, 40,000) | ₹3,20,000 |
| T | (0, 40,000) | ₹2,80,000 |
The maximum profit of ₹3,25,500 occurs at vertex R = (10,500, 34,500).
Conclusion: The manufacturer should produce 10,500 bottles of M₁ and 34,500 bottles of M₂ to achieve the highest possible profit.
Interpreting the Solution (Step 4)
The answer is not just a pair of numbers — it is a production decision with important implications. The model reveals that producing the maximum possible quantity of M₁ (which has the higher per-bottle profit of ₹8) is not the optimal strategy, because the time constraint limits how many high-cost M₁ bottles can be made economically. The optimal mix leans heavily toward M₂.
Let us verify that the solution satisfies all constraints:
-
x = 10,500 ≤ 20,000 ✓
-
y = 34,500 ≤ 40,000 ✓
-
x + y = 45,000 ≤ 45,000 ✓
-
3(10,500) + 34,500 = 31,500 + 34,500 = 66,000 ≤ 66,000 ✓
The solution is fully consistent with every physical constraint. Step 5 is not required here because the model yields an exact, feasible optimal.
What This Example Teaches About Mathematical Modelling
This example demonstrates a crucial insight: linear programming is a mathematical tool; mathematical modelling is the framework that tells you when and how to apply it.
Without the modelling framework, a student might simply maximise M₁ production because ₹8 per bottle > ₹7 per bottle. But the model reveals that the production time constraint makes this suboptimal — only after formulating all constraints as a mathematical system does the correct strategy emerge.
This is also why Principle (v) of mathematical modelling — identifying all governing physical principles — requires you to consider every constraint before setting up the objective function. Missing even one constraint produces a wrong or infeasible answer.
Exam Tips and CUET Relevance
The Linear Programming unit that this example belongs to is assessed: expect questions asking you to state the objective function Z = 8x + 7y and all four constraints, list the six vertices O, P, Q, R, S, T with their coordinates, calculate Z at each, and state the optimal plan with interpretation. The modelling wrapper around it is enrichment. For CUET, the ability to formulate an LP model from a word problem — not just solve a pre-given one — is an increasingly tested skill.
Practise LP and Mathematical Modelling Questions on ChampionsPrep
ChampionsPrep offers targeted MCQs and long-form problems based on Example 5, including vertex-calculation questions, constraint-formulation exercises, and full profit-interpretation problems. with PrepCoin packs from ₹59 with instant AI doubt resolution.
👉 Practise at app.championsprep.in and secure full marks on every LP modelling question.

Linear Programming in Mathematical Modelling: Medicine Production Problem (NCERT Class 12 Example 5)
Frequently Asked Questions
What is the objective function in NCERT Example 5 of Mathematical Modelling? +
The objective function is Z = 8x + 7y, where x is the number of bottles of medicine M₁ and y is the number of bottles of M₂. It represents the total profit and is to be maximised subject to the given constraints.
What are all the constraints in the medicine production LP problem (Example 5)? +
The constraints are: x ≤ 20,000 (raw material for M₁); y ≤ 40,000 (raw material for M₂); x + y ≤ 45,000 (total bottles available); 3x + y ≤ 66,000 (total production time); and x, y ≥ 0 (non-negativity).
What is the maximum profit and optimal plan in NCERT Example 5? +
The maximum profit is ₹3,25,500, achieved by producing 10,500 bottles of M₁ and 34,500 bottles of M₂. This corresponds to vertex R = (10500, 34500) of the feasible region OPQRST.
What are the six vertices of the feasible region in the medicine production problem? +
The six vertices of the feasible region OPQRST are: O(0,0), P(20000,0), Q(20000,6000), R(10500,34500), S(5000,40000), and T(0,40000). The maximum Z occurs at R.
Why is producing only M₁ not the optimal strategy even though it has a higher profit per bottle? +
Although M₁ gives ₹8 per bottle versus ₹7 for M₂, the production time constraint (3x + y ≤ 66,000) means that producing large quantities of M₁ quickly exhausts the available time. The linear programming model balances all constraints simultaneously and finds that a mix — more M₂ with limited M₁ — maximises total profit.
AI-powered practice — free to start