Free Mathematics Class 12 CBSE notes · practise this chapter with an AI quiz

← All study notes

How a Carpenter Decides How Many Chairs and Tables to Build

Learn the language of linear programming — constraints, objective function and feasible solutions — turn real problems into linear programming problems, sketch and classify feasible regions, and find optimal solutions at corner points, including when an unbounded region has none.

How can a graph choose the most profitable plan?

A small workshop has limited wood and working hours but wants the largest profit. Each product uses resources and earns money at a steady rate, so every limit is a straight line on a graph — and the best plan always sits at a corner of the allowed region.

This part covers the terminology, formulating a problem, feasible regions, and finding the optimal solution.

What are constraints, the objective function, optimisation and feasible solutions in a linear programming problem?

A linear programming problem asks for the maximum or minimum of a linear objective function Z=ax+byZ = ax + by subject to linear inequalities called constraints, including x,y≥0x, y \ge 0; points satisfying every constraint are feasible solutions, and the best of them is the optimal solution.

Terminology:

-
Objective function
— the linear function to optimise, Z=ax+byZ = ax + by
- Constraints — linear inequalities the variables must satisfy
- Feasible solution — a point satisfying every constraint; any other point is infeasible
- Optimal solution — a feasible point giving the maximum or minimum value of ZZ

Worked example — identify the parts. Maximise Z=4x+yZ = 4x + y subject to x+y≤50x + y \le 50, 3x+y≤903x + y \le 90, x≥0x \ge 0, y≥0y \ge 0.

- The point (10,20)(10, 20) is feasible, since 30≤5030 \le 50 and 50≤9050 \le 90
- The point (40,20)(40, 20) is infeasible, since 3(40)+20=140>903(40) + 20 = 140 > 90

An everyday example. A student splitting a fixed number of free hours between two subjects is setting up constraints and an objective without calling it linear programming.

The substance. Every expression must be linear — a term like xyxy or x2x^2 takes the problem outside linear programming.

How do you formulate a real-life problem as a linear programming problem?

Define variables for the quantities to be decided, write the objective function for profit or cost, turn every resource limit into a linear inequality, and add the non-negative constraints.

Worked example — the workshop. A carpenter makes chairs and tables. A chair needs 22 hours of work and 11 unit of wood; a table needs 33 hours and 22 units. At most 2424 hours and 1414 units of wood are available each week. The profit is ₹300 on a chair and ₹500 on a table.

Let xx chairs and yy tables be made.

Maximise Z=300x+500y\text{Maximise } Z = 300x + 500y

subject to

2x+3y≤24  (hours),x+2y≤14  (wood),x≥0,  y≥02x + 3y \le 24 \;\text{(hours)}, \qquad x + 2y \le 14 \;\text{(wood)}, \qquad x \ge 0, \; y \ge 0

An everyday example. A dietitian choosing amounts of two foods to meet minimum protein and calcium needs at the lowest cost is formulating a minimisation problem with ≥\ge constraints.

The substance. Leaving out x≥0x \ge 0 and y≥0y \ge 0 can give nonsense answers, such as building a negative number of tables.

How do you draw the feasible region and decide whether it is bounded or unbounded?

Draw each constraint's boundary line, keep the side that satisfies the inequality, and take the region common to all constraints; it is bounded if it can be enclosed in a circle and unbounded if it extends indefinitely.

Worked example — the workshop. For 2x+3y≤242x + 3y \le 24 and x+2y≤14x + 2y \le 14:

- 2x+3y=242x + 3y = 24 meets the axes at (12,0)(12, 0) and (0,8)(0, 8)
- x+2y=14x + 2y = 14 meets the axes at (14,0)(14, 0) and (0,7)(0, 7)
- Solving 2x+3y=242x + 3y = 24 with 2x+4y=282x + 4y = 28 gives y=4y = 4 and x=6x = 6

The feasible region has corners (0,0)(0, 0), (12,0)(12, 0), (6,4)(6, 4) and (0,7)(0, 7), and it is bounded.

An unbounded region. The constraints x+y≥4x + y \ge 4, x≥0x \ge 0, y≥0y \ge 0 allow points as far out as you like, so their region is unbounded.

An everyday example. Marking every place on a map reachable within both a fuel limit and a time limit gives a bounded region.

The substance. If no point satisfies all the constraints, the region is empty and the problem has no feasible solution.

How do you find the optimal solution at corner points, and when does an unbounded region have no optimum?

If an optimal value exists, it occurs at a corner point: for a bounded region compare ZZ at every corner, and for an unbounded region confirm that the half-plane beyond the best corner value contains no feasible point, or else no optimum exists.

Worked example — the workshop.
Evaluating Z=300x+500yZ = 300x + 500y:

- (0,0)(0, 0): Z=0Z = 0
- (12,0)(12, 0): Z=3600Z = 3600
- (6,4)(6, 4): Z=300(6)+500(4)=3800Z = 300(6) + 500(4) = 3800
- (0,7)(0, 7): Z=3500Z = 3500

The maximum profit is ₹3800, from 66 chairs and 44 tables.

Worked example — an unbounded region. For x+y≥4x + y \ge 4, x≥0x \ge 0, y≥0y \ge 0, the corners are (4,0)(4, 0) and (0,4)(0, 4), where Z=2x+3yZ = 2x + 3y takes the values 88 and 1212.

- Minimum: the half-plane 2x+3y<82x + 3y < 8 contains no feasible point, so the minimum is 88 at (4,0)(4, 0)
- Maximum: ZZ grows without limit as xx or yy increases, so there is no maximum

An everyday example. A shop owner comparing the profit from each extreme mix of products is checking corner points — the in-between mixes can never beat the best corner.

The substance. Two corners can tie — then every point on the edge joining them is also optimal.
Exam tip

What earns full marks on linear programming?

Draw the graph to scale with every line labelled, list the corner points in a column with ZZ beside each, and state the optimal point and value in words.

-
Formulation: variables, objective function, constraints, non-negativity
-
Feasible region
: the region common to all constraints; test (0,0)(0, 0) for each
- Corner point method: evaluate ZZ at every corner
- Unbounded check: draw the half-plane beyond the candidate value and confirm it misses the region

The trap. Missing the corner where two constraint lines cross inside the axes. Solve those pairs of equations simultaneously — such a corner is often the optimal point.
Did you know

How do airlines and delivery companies use linear programming?

Deciding which aircraft flies which route, or which truck carries which parcels, involves a huge number of variables and constraints — fuel, crew hours, capacity and timings.

The problems are far too big to draw, but computers use the same principle as this lesson: the best plan lies at a corner of the feasible region, and methods that step from corner to better corner find it quickly.
Exam relevance

Does linear programming matter for JEE Main?

Linear Programming is examined mainly in the Class 12 board paper and is not a separate unit in the JEE Main syllabus, but its core skill — graphing systems of linear inequalities — is used directly in JEE Main coordinate geometry.

What gets asked in boards. Formulating a problem, drawing the feasible region accurately, listing corner points and deciding optimality, including unbounded regions.

Where it helps for JEE. Regions defined by inequalities in Straight Lines, and finding the largest or smallest value of a linear expression over such a region, an idea that can appear in JEE Main and JEE Advanced coordinate geometry.

Question types. Long-answer graphing questions in boards; short region-based reasoning in competitive exams.

The trap that costs marks. Declaring a maximum for an unbounded region without checking the half-plane beyond it.
Key takeaways

What must you be able to do from this part?

- Terminology: objective function Z=ax+byZ = ax + by, linear constraints, non-negativity, feasible and optimal solutions
- Formulation: variables, objective and one inequality per resource; the workshop gives 2x+3y≤242x + 3y \le 24 and x+2y≤14x + 2y \le 14
- Feasible region: the common shaded region, bounded or unbounded, with corners from intercepts and intersections
- Optimum: evaluate ZZ at the corners — ₹3800 at (6,4)(6, 4); for unbounded regions, check the half-plane before concluding

If the profit on a chair rose to ₹400, find the workshop's new best mix and explain why the answer changes.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Linear ProgrammingCreate a free account
← Back to all articles