Linear Programming
It is an important optimization ( maximization or minimization ) technique used in decision making is business and everyday life for obtaining the maximum or minimum values as required of a linear expression to satisfying certain number of given linear restrictions .
Linear Programming Problem ( LPP )
The linear programming problem in general calls for optimizing a linear function of variables called the objective function subject to a set of linear equations and / or linear inequations called the constraints or restrictions .
Objective Function
The function which is to be optimized ( maximized / minimized ) is called an objective function .
Constraints
The system of linear in equations ( or equations ) under which the objective function is to be optimized is called constraints .
Non-negative Restrictions
All the variables considered for making decisions assume non-negative values .
Mathematical Description of a General Linear Programming Problem
A general LPP can be stated as ( Max / Min ) z = clxl + c2x2 + … + cnxn ( Objective function ) subject to constraints
and the non-negative restrictions