A linear programming problem is one that is concerned with finding the optimal value (maximum or minimum) of a linear function of several variables (called objective function), subject to the conditions that the variables are non-negative and satisfy a set of linear inequalities (called linear constraints). Variables are sometimes called decision variables and are non-negative. Studying the Linear Programming of Class 12 enables the students to understand the following:
Introduction, related terminology such as constraints, objective function, optimization, different types of linear programming (L.P.) problems. The mathematical formulation of L.P. problems, graphical method of solution for problems in two variables. Feasible and infeasible regions (bounded or unbounded), feasible and infeasible solutions, optimal feasible solutions (up to three non-trivial constraints). Furthermore, it helps the student while facing other exams in the future.