Introduction to Linear Programming (L.P)
The mathematical definition of linear programming (L.P.) can be stated as – “It is the analysis of problems in which a linear function of a number of variables is to be maximized (minimized), when those variables are subject to a number of restraints in the form of linear inequalities”. Linear programming models thus belong to a class of mathematical programming models concerned with efficient allocation of resources to known activities with the objective of meeting a desired goal. Organizations can have many goals. Hence, a wide variety of problems can be efficiently solved using L.P. technique. Here are a few examples: A product mix problem: Decide the combination of various product quantities to maximise profit or to minimise production cost. Allocation of bank funds: To achieve highest possible returns. This should be achieved within liquidity limits set by RBI and maintaining flexibility to meet the customers demand for loans. Manufacturing Continue reading