Linear Programming
A factory with limited machines and labour must choose the most profitable mix of products. Chapter 12, Linear Programming, of the NCERT Mathematics textbook for Class 12 models such choices. You will formulate an objective function with linear constraints, draw the feasible region, and apply the corner point method to locate the optimum. The chapter covers bounded and unbounded regions, multiple optimal solutions, and diet, manufacturing and transport examples, showing how a graph turns a business decision into a vertex to test.
Try a free lesson