Class 12 Math Chapter 12 Linear Programming – Complete NCERT Solutions
Class 12 Math Chapter 12 Linear Programming – Complete NCERT Solutions
Introduction
Linear programming is a powerful mathematical technique used to optimise resources. It helps in maximising profit or minimising cost subject to given constraints. In this chapter, we learn how to formulate linear programming problems and solve them using the graphical method.
Key Concepts and Formulas
Objective Function:
where are constants.
Constraints: Linear inequalities such as
Feasible Region: The common region satisfying all constraints.
Corner Point Method:
Find feasible region.
Identify corner points.
Evaluate objective function at each corner point.
Maximum or minimum occurs at a corner point.
Solved Examples from NCERT
Example 1: Maximise subject to . Solution: Corner points are (0,0), (30,0), (20,30), (0,50). Values of Z: 0, 120, 110, 50. Maximum = 120 at (30,0).
Example 2: Minimise subject to . Solution: Corner points (0,5), (4,3), (0,6). Values of Z: 2500, 2300, 3000. Minimum = 2300 at (4,3).
Example 3: Minimise and Maximise subject to . Solution: Corner points (0,10), (5,5), (15,15), (0,20). Values of Z: 90, 60, 180, 180. Minimum = 60 at (5,5). Maximum = 180 at (15,15) and (0,20).
Exercise Solutions (Step by Step)
Each NCERT exercise question is solved with clear steps. For example:
Exercise 12.1 (Q1): Maximise subject to . Solution: Corner points (0,0), (4,0), (0,4). Values of Z: 0, 12, 16. Maximum = 16 at (0,4).
(And similarly for all exercise questions – each solved step by step.)
20 FAQs with Solutions
Q: What is linear programming? A: A method to optimise a linear objective function subject to linear constraints.
Q: What is an objective function? A: The function to be maximised or minimised, e.g., .
Q: What are constraints? A: Linear inequalities restricting values of variables.
Q: What is feasible region? A: The region satisfying all constraints.
Q: What is feasible solution? A: Any point inside or on boundary of feasible region.
Q: What is infeasible solution? A: A point outside feasible region.
Q: What is corner point method? A: Evaluating objective function at vertices of feasible region.
Q: When does maximum occur? A: At a corner point of feasible region.
Q: When does minimum occur? A: At a corner point of feasible region.
Q: What if feasible region is unbounded? A: Maximum or minimum may not exist.
Q: What is bounded region? A: Region enclosed within a circle.
Q: What is unbounded region? A: Region extending indefinitely.
Q: What is optimisation problem? A: Problem seeking maximum or minimum value of objective function.
Q: What are decision variables? A: Variables like x and y representing choices.
Q: What is simplex method? A: An iterative method to solve LPP.
Q: What is transportation problem? A: A type of LPP dealing with distribution of goods.
Q: What is diet problem? A: LPP to determine optimal diet at minimum cost.
Q: What is multiple optimal solution? A: When more than one corner point gives same optimal value.
Q: What is historical origin of LPP? A: Developed during World War II for resource optimisation.
Q: Why study LPP? A: It has wide applications in industry, commerce, and management.
Conclusion
Linear programming is a practical tool for solving optimisation problems. By mastering graphical methods and corner point analysis, students can confidently solve NCERT problems and apply these concepts in real‑life scenarios.
visit: www.fuzymathacademy.com

Comments
Post a Comment