NCERT Solutions for Class 12 Maths Chapter 12 Exercise 12.1 Linear Programming Problems LPP in Hindi and English Medium updated for academic session 2022-2023. Videos related to exercise 12.1 is also given in Hindi and English Medium free with complete explanation for CBSE as well as UP board or other state boards to download or use online.
Class 12 Maths Exercise 12.1 Solutions
Class 12 Maths Chapter 12 Exercise 12.1 in Hindi and English
|Chapter: 12||Linear Programming Problems|
|Exercise: 12.1||Hindi and English Medium|
CBSE NCERT Solutions for Class 12 Maths Chapter 12 Exercise 12.1 in Hindi Medium as well as English Medium are given here with videos for session 2022-2023.
Class 12 Maths Exercise 12.1 Solution in Video
What to study in Class 12 Maths LPP
In previous classes, we have discussed systems of linear equations and their applications in day-to-day problems. In the eleventh grade, we have studied the systems of linear inequalities and linear inequalities and their solutions in two variables. Many applications in mathematics involve systems of inequalities / equations. In this chapter, we will apply systems of inequalities / linear equations to solve some real-life problems. These types of problems that seek maximum (or least) profit (or cost) form a common class of problems called optimization problems. Therefore, an optimization problem may involve the discovery of maximum profit, minimum cost, or minimum use of resources, etc.
Application of LPP
A special but very important class of optimization problems is the linear programming problem. The optimization problem mentioned above is an example of a linear programming problem. Problems of linear programming are of great interest due to their wide applicability in industry, commerce, management science, etc. In this chapter, we will study some linear programming problems and their solutions using only graphical methods, although there are many other ways to solve them. Problem.
How to solve LPP
Therefore, we have to subject the linear function Z to some conditions determined by a set of linear inequalities with non-negative variables. There are also some other problems where we have to reduce a linear function subject to certain conditions determined by a set of linear inequalities with non-negative variables. These problems are called linear programming problems.
Therefore, a linear programming problem is one that is concerned with finding the optimal value (maximum or minimum value) of a linear function of several variables (say x and y) that are subject to the conditions of the variable. They are not obsolete and satisfy a set of linear inequalities (called linear constraints).