CBSE Class 12-commerce Maths Linear Programming
Introduction to Linear Programming
The inequations in the variables of an LPP which describe the conditions under which the optimization is to be accomplished are called constraints.Optimal Solution
Feasible Region: The solution to the system of linear inequalities.
Corner Point: A vertex of the feasible region. Not every intersection of lines is a corner point. The corner points only occur at a vertex of the feasible region.
Bounded Region: A feasible region that can be enclosed in a circle. A bounded region will have both maximum and minimum values.Solution of Linear Programming Problems
Solution of Linear Programming Problems
