Mathematics · Class 12 · Probability and Linear Programming · Term 2

Introduction to Linear Programming Problems

Students will define linear programming problems, identify objective functions and constraints.

• CBSE Learning Outcomes
• NCERT: Linear Programming - Class 12

About This Topic

Linear programming problems help students model real-world optimisation scenarios mathematically. They define these problems by identifying decision variables, formulating a linear objective function to maximise profit or minimise cost, and setting linear constraints as inequalities or equations. Class 12 students practise with examples like production planning in factories or resource allocation in agriculture, connecting to NCERT standards on graphical solutions.

This topic builds on Class 11 inequalities and graphing, fostering skills in logical formulation and analysis vital for JEE preparation and careers in management or engineering. Students differentiate objective functions, which express goals like Z = 3x + 4y, from constraints like 2x + y ≤ 10, understanding feasible regions as solution sets.

Active learning suits this topic well. When students in small groups formulate their own problems from local contexts, plot constraints on graph paper, and evaluate corner points, abstract ideas become practical. Collaborative graphing reveals feasible regions clearly, while peer discussions correct errors and emphasise mathematics in everyday decisions.

Key Questions

1. Explain the purpose of linear programming in optimizing real-world situations.
2. Differentiate between an objective function and a constraint in a linear programming problem.
3. Construct a simple real-world problem that can be formulated as a linear programming problem.

Learning Objectives

• Formulate a mathematical model for a given real-world scenario involving resource allocation or production planning.
• Identify and differentiate between the objective function and constraints in a linear programming problem.
• Analyze the graphical representation of constraints to determine the feasible region for a linear programming problem.
• Calculate the optimal value of the objective function at the corner points of the feasible region.

Before You Start

Linear Equations and Inequalities in Two Variables

Why: Students need to be proficient in graphing linear equations and inequalities to represent constraints and identify the feasible region.

Basic Algebra

Why: Understanding algebraic manipulation is essential for formulating the objective function and constraints from word problems.

Key Vocabulary

Objective Function	A mathematical expression, typically linear, representing the quantity to be maximized or minimized, such as profit or cost.
Constraints	Linear inequalities or equations that set limitations on the decision variables, reflecting resource availability or operational restrictions.
Decision Variables	The variables in a linear programming problem that represent the quantities to be determined, such as the number of units of a product to manufacture.
Feasible Region	The set of all possible solutions that satisfy all the constraints of a linear programming problem, represented graphically as a polygon.
Corner Points	The vertices of the feasible region, where the optimal solution to a linear programming problem is found.

Watch Out for These Misconceptions

Common Misconception

The objective function must always be maximised.

What to Teach Instead

Linear programming includes both maximisation and minimisation problems. Group graphing activities let students test both cases on the same feasible region, observing how optima shift to different vertices and building flexibility in approach.

Common Misconception

All constraints are strict equalities.

What to Teach Instead

Constraints are typically inequalities defining a region, not just lines. Hands-on plotting in pairs helps students shade areas correctly, distinguishing feasible polygons from single lines through visual comparison.

Common Misconception

Non-linear objectives can still be solved graphically.

What to Teach Instead

Objectives and constraints must be linear for standard methods. Collaborative problem-solving reveals why curves complicate regions, as students attempt and fail to shade non-linear areas, reinforcing linearity via trial.

Active Learning Ideas

Pairs: Scenario Formulation

Pairs receive cards with real-life situations, such as a farmer maximising crop yield under irrigation limits. They define variables, write the objective function and three constraints. Pairs present one formulation to the class for feedback.

30 min·Pairs

Small Groups: Feasible Region Graphing

Groups plot two to three inequalities on graph paper, shade the feasible region, and mark vertices. They test sample objective functions at corners to find optimal points. Groups compare regions and discuss boundary effects.

45 min·Small Groups

Whole Class: Application Modelling

The class brainstorms Indian business scenarios like textile production. Teacher guides collective formulation on the board, graphing constraints together. Students vote on the optimal solution and justify choices.

25 min·Whole Class

Individual: Corner Point Evaluation

Students receive a pre-graphed feasible region with an objective function. They list vertices, compute values, and identify the optimum. Share results in a quick gallery walk.

20 min·Individual

Real-World Connections

• Production managers at a furniture factory in Jalandhar use linear programming to decide how many tables and chairs to produce daily, optimizing profit given limited wood and labor resources.
• Logistics coordinators for a food delivery service in Bengaluru apply linear programming to determine the most efficient routes for their delivery agents, minimizing travel time and fuel costs.
• Agricultural planners in rural Maharashtra might use linear programming to allocate land for different crops, maximizing yield based on soil type, water availability, and market demand.

Assessment Ideas

Quick Check

Present students with a short word problem, for example: 'A tailor makes shirts and trousers. Each shirt requires 2 hours of cutting and 3 hours of stitching. Each trouser requires 3 hours of cutting and 2 hours of stitching. The tailor has 120 hours of cutting time and 110 hours of stitching time available. Formulate the objective function and constraints for maximizing profit, assuming a profit of Rs. 50 per shirt and Rs. 70 per trouser.'

Discussion Prompt

Ask students to explain in their own words why the optimal solution for a linear programming problem is always found at a corner point of the feasible region. Encourage them to use a simple graphical example to support their explanation.

Exit Ticket

Provide students with a set of linear inequalities representing constraints. Ask them to: 1. Graph the inequalities to find the feasible region. 2. List the coordinates of the corner points of the feasible region. 3. Identify which corner point would maximize an objective function like Z = 2x + 3y.

Frequently Asked Questions

What is a linear programming problem in Class 12 Maths?

A linear programming problem optimises a linear objective function subject to linear constraints. Students formulate it with variables like x and y for quantities, Z = ax + by as the goal, and inequalities like 2x + 3y ≤ 12 for limits. Graphical methods find solutions in the feasible region, aligning with NCERT exercises on real applications like diet or transport.

How to differentiate objective function from constraints in LPP?

The objective function states what to maximise or minimise, such as profit Z = 5x + 3y. Constraints limit variables, written as inequalities or equations like x + 2y ≤ 10. Practice with pair formulation clarifies this, as students label parts distinctly before graphing.

Real-world examples of linear programming problems for Class 12?

Examples include maximising school canteen profit under budget constraints, minimising transport costs for goods from factories to markets, or allocating study time for exams with subject limits. These relatable Indian contexts make formulation engaging and show optimisation in daily commerce.

How can active learning help teach linear programming?

Active learning engages students through graphing feasible regions in groups, formulating problems from local scenarios like farming, and evaluating corner points collaboratively. This hands-on method makes abstract inequalities tangible, corrects misconceptions via peer review, and links theory to JEE-style problems, boosting retention and confidence over lectures.