NCERT Solutions For Class 12 Mathematics Chapter 12: Linear Programming

Jasmine Grover logo

Jasmine Grover

Content Strategy Manager

NCERT Solutions for class 12 Mathematics chapter 12 Linear Programming are provided in the article. Linear Programming Problem (or LPP) is the problem that’s concerned with achieving the most effective optimal (maximum or minimum) value of a linear function with several variables (called objective function). LLP has some conditions like the variables are non-negative and satisfy a collection of linear inequalities (also referred to as linear constraints).

Download: NCERT Solutions for Class 12 Mathematics Chapter 12 pdf


Class 12 Maths NCERT Solutions Chapter 12 Linear Programming

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions

NCERT Solutions


Important Topics in Class 12 Mathematics Chapter 8 Applications of Integrals

Class 12 Mathematics Chapter 12 has the following important concepts: 

Linear Programming Problem and Mathematical Formulation

Mathematical formulation of the problem

Mathematical formulation section explains the formulation of mathematical problems. It defines the non-negative constraints, objective function, decision variables.

Key Points: 

  • A linear programming problem is finding the optimal value [maximum or minimum] of a linear function of variables, which are subjected to certain conditions and satisfying a set of linear constraints.
  • Optimal value of a linear function is called an objective function.
  • Variables involved in the objective function are called decision variables.
  • The constraints are the restrictions on the variables.

Graphical method of solving linear programming problems

Graphical method of solving linear programming problems section covers the definition of feasible region, feasible solution and infeasible solution, optimal solution, bounded and unbounded region of feasible solution. It also includes the Corner Point Method that helps to solve linear programming problems with solved examples.

Key Points:

  • Region obtained by constraints [and non-negative constraints] can be called the feasible region.
  • Points within the feasible region are called feasible solutions.
  • Points outside the feasible region are called infeasible solutions.
  • Point in the feasible region which gives optimal value of the objective function is called optimal solution.

Different Types of Linear Programming Problems

Here are the different Types of Linear Programming Problems:

  • Manufacturing Problems

Manufacturing problems can be seen in the manufacturing sector in to optimise production by maximising profits. Profits can be a function of the number of workers, working hours, materials required, the value of the product in the market, the demand for the product, the supply of the product etc.

  • Diet problems

Diet problems involve optimisation of the amount of intake of different types of foods required by the body to obtain necessary nutrients. Agenda of a diet problem will be selecting those foods with the required nutrient at a lesser cost.

  • Transportation problems

Transportation problems involve transportation of manufactured goods to different places so that transportation cost is reduced. For big companies, analysis of transportation cost is very important as it caters to a widespread area. 


NCERT Solutions For Class 12 Maths Chapter 12 Exercises

Detailed solutions for all NCERT Solutions for Chapter 12 Linear Programming under different exercises are as follows:


Also Read:

Check-Out: 

CBSE CLASS XII Related Questions

1.
2, b, c are in A.P. and the range of determinant $\begin{vmatrix}1&1&1\\ 2&b&c\\ 4&b^{2}&c^{2}\end{vmatrix}$ is [2, 16]. Then find range of c is

    • [6, 8]
    • [0, 4]
    • [8, 12]
    • [4, 6]

    2.
    For what values of x,\(\begin{bmatrix} 1 & 2 & 1 \end{bmatrix}\)\(\begin{bmatrix} 1 & 2 & 0\\ 2 & 0 & 1 \\1&0&2 \end{bmatrix}\)\(\begin{bmatrix} 0 \\2\\x\end{bmatrix}\)=O?

        3.
        If A'= \(\begin{bmatrix} 3 & 4 \\ -1 & 2 \\ 0 &1 \end{bmatrix}\)\(\begin{bmatrix}  -1 & 2 & 1 \\ 1 &2 & 3\end{bmatrix}\) , then verify that 
        (i) \((A+B)'=A'+B' \)
        (ii) \((A-B)'=A'-B'\)

            4.
            Find the inverse of each of the matrices,if it exists. \(\begin{bmatrix} 2 &  3\\ 5 & 7 \end{bmatrix}\)

                5.

                If f (x) = 3x2+15x+5, then the approximate value of f (3.02) is

                  • 47.66
                  • 57.66
                  • 67.66
                  • 77.66

                  6.
                  Find the inverse of each of the matrices, if it exists. \(\begin{bmatrix} 1 &  3\\ 2 & 7\end{bmatrix}\)

                      CBSE CLASS XII Previous Year Papers

                      Comments



                      No Comments To Show