Every linear programming problem you solve in Class 12 starts life as a word problem — a story about a dealer, a manufacturer, or a farmer trying to make the best decision under limited resources. Before you can graph anything or find an answer, you must first translate that story into mathematics. This process is called mathematical formulation, and it is arguably the most important skill in the entire chapter, because a wrong formulation guarantees a wrong answer no matter how carefully you graph it afterward.
This post walks through exactly how to convert a real-world scenario into the four building blocks every LPP needs: decision variables, the objective function, constraints, and non-negative restrictions.
The Four Building Blocks of Every LPP
1. Decision Variables
Decision variables are the unknown quantities you are trying to determine. They represent the choices available to the decision-maker. In almost every Class 12 problem, you will define two decision variables, typically labelled x and y.
For example, if a furniture dealer buys tables and chairs, you would let:
-
x = number of tables the dealer buys
-
y = number of chairs the dealer buys
Choosing clear, well-labelled decision variables at the start makes every subsequent step easier.
2. The Objective Function
The objective function is the linear expression you want to maximise or minimise. It is usually written as Z = ax + by, where a and b are constants representing per-unit profit, cost, or another measurable quantity.
In the furniture dealer example, since a table yields Rs 250 profit and a chair yields Rs 75 profit, the objective function becomes:
Z = 250x + 75y
The dealer’s goal is to maximise this Z. In cost-minimisation problems, such as a transportation or diet problem, you would instead look to minimise Z.
3. Constraints
Constraints are the linear inequalities (or occasionally equations) that represent the limitations under which the decision-maker operates — money, time, storage, raw material, or labour availability.
Going back to the furniture example, the dealer has two restrictions:
-
Investment constraint: He has only Rs 50,000 to spend. Since a table costs Rs 2,500 and a chair costs Rs 500, the total spending must satisfy: 2500x + 500y ≤ 50000, which simplifies to 5x + y ≤ 100.
-
Storage constraint: He can store at most 60 pieces total, so: x + y ≤ 60.
Notice how each constraint is derived directly from a sentence in the word problem. This is the core skill of formulation — reading a restriction in words and rewriting it precisely as an inequality.
4. Non-Negative Restrictions
Since x and y represent physical quantities like the number of tables or chairs, they cannot logically be negative — you cannot buy -3 chairs. So every LPP automatically includes:
x ≥ 0, y ≥ 0
These are called non-negative restrictions, and while they might seem obvious, they are a compulsory part of every formulation and play an important role later when you graph the feasible region only in the first quadrant.
Putting It All Together
Once you have identified all four components, the complete mathematical formulation of the furniture dealer’s problem reads as:
Maximise Z = 250x + 75y
subject to the constraints:
-
5x + y ≤ 100
-
x + y ≤ 60
-
x ≥ 0, y ≥ 0
This compact block of mathematics captures the entire real-world story — the dealer’s budget, his storage limit, and his profit goal — in a form that can now be solved using graphical methods, which you’ll explore in the next post of this series.
A Step-by-Step Formulation Checklist
Whenever you face a new word problem, work through these steps in order:
-
Read the problem twice. Identify what quantity is being maximised or minimised (this hints at your objective function).
-
Define your decision variables clearly. Write “Let x = …” and “Let y = …” explicitly — never skip this step, even in exams.
-
Identify every limiting resource mentioned — money, time, space, material — and convert each sentence into an inequality.
-
Write the objective function using the per-unit profit or cost values given.
-
Add the non-negative restrictions x ≥ 0, y ≥ 0 as the final two constraints.
-
Double-check units. A common mistake is mixing rupees with number of units; make sure every term in an inequality has the same unit basis.
Common Mistakes Students Make
-
Forgetting non-negative restrictions: Even though they seem trivial, omitting x ≥ 0, y ≥ 0 costs marks in board exams.
-
Reversing the inequality direction: A “maximum of 60 pieces” means ≤ 60, not ≥ 60. Read constraint language carefully.
-
Mixing up cost and profit: The objective function generally uses profit-per-unit figures, while constraints use cost-per-unit or resource-per-unit figures. Confusing the two derails the entire problem.
-
Skipping units simplification: Always simplify constraints like 2500x + 500y ≤ 50000 down to their simplest form (5x + y ≤ 100) — it makes the following graphing step far easier.
Practice Formulation Problems on ChampionsPrep
Formulation is a skill built through repetition, not memorisation. ChampionsPrep offers AI-powered, chapter-wise practice sessions with PrepCoin packs from ₹59 for CBSE and Maharashtra State Board Class XI–XII Commerce students, plus focused preparation for CUET, IPMAT, JIPMAT, NPAT, and SET. Practise converting word problems into objective functions and constraints until it becomes second nature — start your session on ChampionsPrep today.

Mathematical Formulation of Linear Programming Problems
Frequently Asked Questions
What are decision variables in linear programming? +
Decision variables are the unknown quantities a problem asks you to determine, such as the number of two products to manufacture or buy, usually represented as x and y.
What is the objective function in an LPP? +
The objective function is the linear expression Z = ax + by that represents the quantity - typically profit or cost - that needs to be maximised or minimised.
Why are non-negative restrictions always included in LPP? +
Because decision variables represent real, physical quantities like units of a product, which cannot logically be negative.
How do I know if a sentence in a word problem should become a constraint? +
Any sentence that mentions a limit, maximum, minimum, or fixed amount of a resource - money, time, space, material - should be converted into a constraint inequality.
What is the difference between constraints and the objective function? +
Constraints define the boundaries or limitations within which a solution must lie, while the objective function defines what you are trying to optimise within those boundaries.
AI-powered practice — free to start