Linear Programming Class 12 Notes – Chapter 12
In here, the variables are non-negative and satisfy a set of linear inequalities (called linear constraints) and the problems have the goal to find the optimal value (maximum or minimum) of a linear function of several variables (called objective function) with respect to the conditions. Variables are sometimes called decision variables and are non-negative in nature. Please refer Linear Programming Class 12 Notes for more revision notes.
CBSE Revision Notes 