Скачать или смотреть NCERT MATHs class 12 chapter 12 exercise 12.2 question 1 in English | Linear Programming

Linear Programming Problems: Diet problem (aka Product-Mixture Problem) with Costs minimization

NCERT MATHs class 12 chapter 12 exercise 12.2 question 1 in English | 12.3 Different Types of Linear Programming Problems

Previous knowledge: 12.3 Graphical method of solving linear programming problems
NCERT MATH class 12 Chapter 12 in English | Graphical method of solving linear programming problems

This is a complete explanation for NCERT MATHs class 12 chapter 12 exercise 12.2 question 1 provided in English. The topic is dedicated to Linear programming problems. The original problem NCERT MATHs class 12 chapter 12 exercise 12.2 question 1 and solutions you can find here:

https://www.learncbse.in/ncert-soluti...

I made my own problem similar to what you, guys have in your book (see the link above). This will give you a bit more practice. Don't forget to Subscribe and share this video to anyone who interested in MATHs tutorials in English and also leave the comments about how useful this video was for you and about topics I could clarify for you, guys!


Make sure you watched all 4 previous videos dedicated to basics of Inequalities on Graphs:

GCSE MATHs solving linear inequalities by graphing | Shading Regions and Graphing Inequalities    • GCSE MATHs solving linear inequalities by ...  

GCSE MATHs Inequalities | Graph the region described by the inequality | Graph the feasible region    • GCSE MATHs Inequalities | Graph the region...  

GCSE MATHs Inequalities | Write inequalities which define the shaded region | Inequalities on graphs    • GCSE MATHs Inequalities | Write inequaliti...  

GCSE MATHs Inequalities | Integer solutions to inequalities | Integer points in regions | Graphs    • GCSE MATHs Inequalities | Integer solution...  

Here are two Theorems that we are going to use:

Theorem 1 Let R be the feasible region (convex polygon) for a linear programming
problem and let Z = ax + by be the objective function. When Z has an optimal value
(maximum or minimum), where the variables x and y are subject to constraints described
by linear inequalities, this optimal value must occur at a corner point* (vertex) of the
feasible region.

Theorem 2 Let R be the feasible region for a linear programming problem, and let
Z = ax + by be the objective function. If R is bounded**, then the objective function
Z has both a maximum and a minimum value on R and each of these occurs at a
corner point (vertex) of R.

Optimization:

LPP, Linear Programming Problem , LPP in Hindi , Chapter 12 , Class 12 Maths ,
Objective function , Constraints , Optimisation Problem , feasible region , Feasible solutions , infeasible region ,
NCERT CBSE XII Maths , NCERT Classes , CBSE Classes , 12th NCERT Maths, Chapter12, Linear Programming-Graphical Method(Solution of Exercise-12.2)
School Mathematics, 12th maths, lpp , linear programming , solution of LPP by graphical method, corner point method, optimal solution , feasible region , unbounded solution of LPP , no solution of LPP , infinite solution of LPP , unique solution of LP , ncert maths, mp board maths
NCERT XII Maths Chap-12.2 Ex 12.2 LPP Linear Programming Problem , class 12 maths chapter 12 miscellaneous exercise , 12 th NCERT Mathematics LINEAR PROGRAMMING EXERCISE 12.2 Solution, ncert linear programming exercise 12.2 solution in english, NCERT class 12 exercise 12.2 Solution, NCERT MATH class 12 Chapter 12.2 in english, Class12th NCERT EXERCISE 12.2 Solution english, Graphical method of solving linear programming problems, Graphical method of solving linear programming problems in english, class 12 maths chapter 12 exercise 12.2 in english, class 12 maths chapter 12 linear programming in english, 12.2.2 Graphical method of solving linear programming problems
NCERT MATHs class 12 chapter 12 exercise 12.2 question 1 in English, ncert maths class XII chapter 12 exercise 12.2 question 1 in English, class 12 maths linear programming ncert solutions 12.2, class xii maths chapter 12 llp, class 12 maths chapter 12 exercise 12.2 question 1, ncert math class 12 chapter 12.2, ncert maths class 12 chapter 12 exercise 12.2 question 1, ncert maths class 12 chapter 12.3 exercise 12.1 question 1, NCERT MATHs class xii chapter 12 exercise 12.2 question 1
NCERT MATHs class 12 12.2 Linear Programming Problem and its Mathematical Formulation, NCERT MATHs class 12 12.2.1 Mathematical formulation of the problem, NCERT MATHs class 12 12.2.2 Graphical method of solving linear programming problems, 12.3 Different Types of Linear Programming Problems, ncert maths class 12 ch 12 ex 12.2


#ncertsolution #ncertclass12mathex2 #ncertmath #inequalities #inequalitiestricks #linearinequalities #inequalitytricks #inequalities #inequalitiestricks