Linear Programming

1. Linear Programming

2. Introduction:Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’, subject to a set of linear equations and/or inequations, known as ‘constraints’. The objective function may be profit, cost, production capacity or any other measure of effectiveness, which is to be obtained in the best possible or optimal manner. There are two words to be understood – ‘Linear’ and ‘Programming’. The word ‘linear’ refers to linear relationship among the variables in a model. Hence, a given change in one variable will always result in a proportional change in the other variable(s). For example, doubling the investment on a certain project will also double the rate of return. The word ‘programming’ refers to the mathematical modeling and solving a problem that involves the economic allocation of limited resources, by choosing a particular course of action or strategy among the various alternatives in order to achieve the desired result.

3. Structure of Linear Programming Model:A linear programming problem may be defined as the problem of ‘maximizing or minimizing a linear function subject to linear constraints’. The constraints may be equalities or inequalities. Here is a simple example. Find numbers X1 and X2 that maximizes the sum (X1 + X2) subject to the constraints X1 + 2X2≤ 4 4X1 + 2X2≤ 12−X1 + X2 ≤ 1and, X1 ≥ 0, X2≥ 0In this problem there are two unknowns, and five constraints. All the constraints are inequalities and they are all linear in the sense that each involves an inequality in some linear function of the variables. The last two constraintsX1≥ 0 andX2≥ 0, are special. These are called ‘non-negativity constraints’ and are often found in linear programming problems. The other constraints are then called the ‘main constraints’. The function to be maximized (or minimized) is called the ‘objective function’ and is denoted by ‘Z’. Hence, the objective function is ‘maximize Z = X1 + X2’.

4. General Form of LPP:The general linear programming model with ‘n’ decision variables and ‘m’ constraints can be stated in the following form:Find the values of X1,X2,……, Xnso as toMaximize (or Minimize) Z = C1X1+C2X2+…….+CnXnsubject to the constraintsa11X1+ a12X2 +….+ a1nXn (≤ or = or ≥)b1 a21X1+ a22X2 +….+ a2nXn (≤ or = or ≥)b2 . . . . . . . .am1X1+ am2X2 +….+ amnXn (≤ or = or ≥)bnand X1,X2,……, Xn ≥ 0where aij’sare the ‘technological coefficients’ or ‘input-output coefficients’; birepresents the ‘total availability of ithresource’ and Cij’sare the ‘coefficients representing per unit contribution of decision variable Xj’.i = 1,2,3,…., m and j = 1,2,3,……, n.

5. Steps in Formulation of LPP: Step1: Identify the decision variables and assign symbols x1,x2,x3…. to them. These decision variables are those quantities whose values we wish to determine. Step2: Identify the set of constraints and express them as linear equations/ inequations in terms of the decision variables. These constraints are the given conditions. Step3: Identify the objective function and express it as a linear function of decision variables. It might take the form of maximizing profit or production or minimizing cost. Step4: Add the non-negativity restrictions on the decision variables, as in the physical problems, negative values of decision variables have no valid interpretation.