Home / Learn / Exam prep / CUET (UG) prep / Lesson 8.9
All lessons

Module 8: Mathematics · Lesson 8.9 · about 16 min

Maths: linear programming

Turning a word problem into a linear programming problem, drawing the feasible region, and finding the best value with the corner point method, including unbounded regions, with a live problem.

Key points, meanings and formulas on one page: choose "Save as PDF" in the print box.

Module 8 · about 16 minutes. A short, scoring chapter. By the end you will set up and solve any two-variable LPP.

Linear programming finds the best plan when resources are limited. Draw every limit as a straight line, the allowed plans form a polygon, and the best plan is always at one of its corners.

Everyday picture: a tiffin service with 20 kg of rice and 8 hours of cooking time, making veg and chicken meals that earn different profits. How many of each should it cook? Every limit is a line; the answer sits at a corner where two limits meet.

1. Setting up

Part Meaning Example
Decision variables what you choose x veg meals, y chicken meals
Objective function what you maximise or minimise Z = 40x + 60y (profit)
Constraints the limits x + y ≤ 20, x ≤ 12, y ≤ 15
Non-negativity no negative amounts x ≥ 0, y ≥ 0

2. The corner point method

Draw each constraint as a line (replace ≤ with =) and shade the side that satisfies it (test (0, 0)).
The feasible region is where all the shadings overlap.
List the corners: the axes' intercepts and where boundary lines cross (solve their equations together).
Evaluate Z at every corner.
Bounded region: the largest is the maximum and the smallest the minimum. Unbounded: check the extra half-plane before you claim one.
Feasible solution
any point in the region: a plan that breaks no rule.
Optimal solution
the feasible point that gives the best Z. If two corners tie, every point on the edge between them is optimal too.
Physical meaning
moving the line Z = constant parallel to itself until it last touches the region shows why corners win.

“The best answer is where all constraints are used up exactly.” Often one resource is left over. The optimum is at a corner where some constraints are tight, not necessarily all of them.

3. Practice

Do the live problem above until you get five right in a row, then try the question set.

  • Variables, objective, constraints, non-negativity.
  • Feasible region = overlap of all constraints.
  • Evaluate Z at every corner; bounded → max and min exist.
  • Unbounded: check Z > M (or Z < m) has no point in the region.

Check yourself

1In the corner point method, the optimal value of Z occurs:
2The constraints x ≥ 0 and y ≥ 0 are called:
3If the feasible region is unbounded, a maximum:

Sources

  • NCERT, Mathematics Part II (Class 12), Linear Programming
  • National Testing Agency, CUET (UG) Mathematics syllabus https://cuet.nta.nic.in/ (checked 2026-11-22)
  • Questions: original fibub writing for this course

Your ticks stay in this browser. Save them as a file on the course home.

Updated 2026-11-22. The exam pattern follows the NTA CUET (UG) information bulletin as checked on 2026-11-22: check cuet.nta.nic.in for the current year. fibub is a free independent site, not part of NTA; every question here is original. Practice runs in your browser and nothing you answer is sent anywhere.