Subject specialists have created NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming, which includes thorough solutions for reference. All of the questions from the textbook’s exercises are answered here. Students can use these answers to help them prepare for their exams. The NCERT Solutions for Class 12 provide useful solutions for improving conceptual knowledge.

The solutions are carefully solved using student-friendly terms while still adhering to the norms that must be followed when solving NCERT Solutions for Class12. Practicing these answers can be incredibly advantageous not only in terms of exams but also in terms of helping Class 12 pupils perform well in upcoming competitive exams.

The approaches for answering have been given special consideration to stay on target while not deviating from the intended answer. Because time is so important in exams, excellent time management when answering questions is essential for getting the best results.

**NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming**

**Beneath are the theoretical concepts covered in Class 12 Maths Chapter 12 Linear Programming:**

**12.1 Introduction**

This section summarises the preceding grades’ discussions of linear equations, linear inequalities, and linear inequalities applications. It uses an example to illustrate the concept of optimization problems and a subset of optimization problems known as linear programming problems. The maximization of profit while lowering the cost of a production unit is an excellent example of optimization.

**12.2 Linear Programming Problem and its Mathematical Formulation**

This section contains an example of a furniture trader who is attempting to optimize revenues by experimenting with various chair and table combinations.

12.2.1 Mathematical formulation of the problem

- The formulation of the above-mentioned mathematical issue is further explained in this part. The non-negative restrictions, objective function, and decision variables are all defined in this document.
- An objective function can be used to define the optimal value of a linear function.
- Finding the optimal value [maximum or minimum] of a linear function of variables subject to particular conditions and satisfying a set of linear constraints is a linear programming issue.
- Decision variables are variables that are involved in the objective function.

- The variables are restricted by the constraints.

12.2.2 Graphical method of solving linear programming problems

- The definition of the feasible region, feasible and infeasible solutions, optimal solutions, and bounded and unbounded feasible solution regions are all covered in this section. It gives a quick overview of the Corner Point Method, which is used to solve linear programming issues, and includes examples.
- The feasible region is defined as the region obtained by the restrictions [including non-negative constraints].
- Possible solutions are the points that fall within the practicable zone.

- Infeasible solutions are points outside of the feasible zone.
- An optimal solution is a point in the feasible zone that offers the optimal value of the objective function.

**12.3 Different Types of Linear Programming Problems**

Different types of linear programming problems are discussed in this section.

12.3.1 Manufacturing problems

- These issues can be encountered in the manufacturing industry in order to maximize earnings while optimizing production. Profits can be determined by the number of employees, working hours, resources required, the market value of the product, demand for the product, supply of the product, and so on.

12.3.2 Diet problems

- Such issues entail optimizing the number of different types of foods consumed in order for the body to acquire the nutrients it requires. A diet problem’s aim will be to choose foods that provide the essential nutrition at a lower cost.

12.3.3 Transportation problems

- These issues concern the efficient delivery of manufactured items to various locations at the lowest possible cost. The analysis of transportation costs is very important for large companies because it caters to a wide area.

Students can utilize the Infinity Learn **NCERT Solutions for Class 12 Maths Chapter 12** for learning any kind of complex topics.

The number of questions available in the exercise of NCERT Solutions for Class 12 Maths Chapter 12 :

Exercise 12.1 Solutions – 10 Questions

Exercise 12.2 Solutions – 11 Questions

Miscellaneous Exercise On Chapter 12 Solutions – 10 Questions

A few points on NCERT Class 12 Maths Chapter 12 Linear Programming

The chapter Linear Programming is divided into five units, each of which is worth five points out of a possible eighty. This chapter includes two exercises as well as a miscellaneous activity to help students fully comprehend the fundamentals of linear programming. The following are some of the topics covered in Chapter 12 of NCERT Solutions for Class 12 Maths:

- A linear programming issue is one in which the goal is to determine the best value (maximum or minimum) of a linear function of numerous variables (called the objective function), given that the variables are non-negative and the variables satisfy a set of linear inequalities (called linear constraints). Decision variables are non-negative variables that are sometimes referred to as decision variables.

- The important linear programming problems are listed below:

- Diet problems
- Manufacturing problems
- Transportation problems

- The viable region (or solution region) of a linear programming problem is the common region given by all the constraints, including the non-negative constraints x 0, y 0.
- Possible solutions to the limitations are represented by points within and on the boundary of the viable zone.

- A solution that is outside the feasible zone is infeasible.
- An optimal solution is a point in the feasible zone that gives the objective function’s optimal value (maximum or minimum).

- If the viable zone is unbounded, there may be no maximum or minimum. If it does exist, it must occur at an R corner point.
- When addressing a linear programming issue, the corner point approach is applied.
- If two feasible region corner points are both optimal solutions of the same kind, i.e., they yield the same maximum or minimum, then every point on the line segment connecting them is likewise an optimal solution of the same type.

Students can Learn about the following topics by studying Linear Programming in Class 12 with NCERT Solutions: introduction, related terminologies such as constraints, objective function, optimization, different types of linear programming (L.P.) problems, mathematical formulation of L.P. problems, and more. viable and infeasible regions (bounded or unbounded), feasible and infeasible solutions, optimal feasible solutions, the graphical technique of solution for problems in two variables (up to three non-trivial constraints). Furthermore, the NCERT Solutions boosts pupils’ confidence when it comes to taking future tests.

**Frequently Asked Questions on NCERT Solutions for Class 12 Maths Chapter 12 **

- How many problems are there in each exercise of the NCERT Solutions for Class 12 Maths Chapter 12?
- What do you mean by linear programming in Chapter 12 of NCERT Solutions for Class 12 Maths?
- Where can I get NCERT Solutions for Class 12 Maths Chapter 12 online?

**1. How many problems are there in each exercise of the NCERT Solutions for Class 12 Maths Chapter 12? **

Three problems are included in Chapter 12 of the NCERT Solutions for Class 12 Maths. Exercise 12.1 contains 10 questions, Exercise 12.2 contains 11 questions, and the miscellaneous exercise contains 10 questions that span all of the concepts in this chapter. Every problem is addressed with the utmost care in order to deliver accurate solutions to the students in accordance with CBSE norms.

**2. What do you mean by linear programming in Chapter 12 of NCERT Solutions for Class 12 Maths? **

Linear programming is a mathematical concept in which mathematical functions are constrained and then minimized or maximized as a result. This chapter’s objective functions and constraints are all totally linear. The minimum and maximum values of the linear functions are shown on the xy coordinate for further deductions. The basic goal of linear programming is to improve mathematical functions that are constrained by linear constraints.

**3. Where can I get NCERT Solutions for Class 12 Maths Chapter 12 online? **

Infinity LEARN has the NCERT Solutions for Class 12 Maths Chapter 12 available for download. Subject specialists curate the solutions to all of the problems so that students have the best reference material to rely on. You can download chapter-by-chapter or exercise-by-exercise solutions to acquire a better understanding of the problem-solving approaches used to solve textbook issues.