INTRODUCTION TO LINEAR PROGRAMMING
Linear programming is an optimization technique for a system of
linear constraints and a linear objective function.
An objective function defines the quantity to be optimized, and the
goal of linear programming is to find the values of the variables that
maximize or minimize the objective function.
Linear programming is useful for many problems that require an
optimization of resources.
It could be applied to manufacturing, to calculate how to assign labor
and machinery to minimize cost of operations.
It could be applied in high-level business operations, to decide which
products to sell and in what quantity in order to maximize profit.
It could also be applied in logistics, to decide how to apply resources
to get a job done in the minimum amount of time.
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 4 / 62
IMPORTANT TERMS OF LINEAR PROGRAMMING
Decision variables: Mathematical symbols representing levels of
activity of a firm.
Objective function: Linear mathematical relationship describing an
objective of the firm, in terms of decision variables, that is maximized
or minimized.
Constraints: Restrictions placed on the firm by the operating
environment stated in linear relationships of the decision variables.
Parameters: Numerical coefficients and constants used in the
objective function and constraint equations.
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 5 / 62
COMPONENTS OF LINEAR PROGRAMMING
The decision variable
The environment (uncontrollable) parameters
The result (dependent) variable
Linear Programming Model is composed of the same components
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 6 / 62
MATHEMATICAL FORMULATION OF LINEAR
PROGRAMMING
If xj , (j = 1, 2, 3, . . . , n) are n decision variables and the system is
subject to m constraint equations , then the general mathematical
formulation of LPP is as
OBJECTIVE FUNCTION
Optimize (Maximize or Miminize) Z = f (x1 , x2 , . . . , xn )
CONSTRAINT EQUATIONS
subject to gi (x1 , x2 , . . . , xn ) ≤, =, ≥ bi , (i = 1, 2, 3, . . . , m)
NON-NEGATIVE RESTRICTION OR CONSTRAINT
and x1 , x2 , x3 , . . . , xn ≥ 0
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 7 / 62
The general form of mathematical formulation of LPP is as
Optimize (Maximize or Miminize) Z = c1 x1 + c2 x2 + . . . + cn xn
subject to a11 x1 + a12 x2 + . . . + a1n xn ≤, =, ≥ b1
a21 x1 + a22 x2 + . . . + a2n xn ≤, =, ≥ b2
........................................................
........................................................
........................................................
am1 x1 + am2 x2 + . . . + amn xn ≤, =, ≥ bn
and x1 , x2 , x3 , . . . , xn ≥ 0
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 8 / 62
FORMULATION OF A LINEAR PROGRAMMING
PROBLEM
The formulation of the LPP as mathematical model involves the following
key steps:
Step 1. Identify the decision variables to be determined and express
them in terms of algebraic symbols as x1 , x2 , . . . , xn .
Step 2. Identify the objective which is to be optimized (maximized or
minimized) and express it as a linear function of the above defined
decision variables.
Step 3. Identify all the constraints in the given problem and then
express them as linear equations or inequalities in terms of above
defined decision variables.
Step 4. Non-negativity restrictions on decision variables.
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 9 / 62
PROBLEMS ON FORMULATION OF LPP
PROBLEM 1 : Production allocation problem Four different type of
metals, namely, iron, copper, zinc and manganese are required to produce
commodities A, B and C. To produce one unit of A, 40kg iron, 30kg copper,
7kg zinc and 4kg manganese are needed. Similarly, to produce one unit of
B, 70kg iron, 14kg copper and 9kg manganese are needed and for producing
one unit of C, 50kg iron, 18kg copper and 8kg zinc are required. The total
available quantities of metals are 1 metric ton iron, 5 quintals copper, 2
quintals of zinc and manganese each. The profits are Rs 300, Rs 200 and
Rs 100 by selling one unit of A, B and C respectively. Formulate the problem
mathematically.
K.BHARATHI,SCSVMV. LINEAR PROGRAMMING PROBLEM 10 / 62
