1. www.sanjivanimba.org.in
302-DECISION SCIENCE
Unit No.1. LPP
1.1 Introduction to LPP
Presented By:
Dr. V. M. Tidake
Ph. D (Financial Management), MBA(FM), MBA(HRM) BE(Chem)
Professor & Head Dept. of MBA
1
Sanjivani College of Engineering, Kopargaon
Department of MBA
www.sanjivanimba.org.in
4. www.sanjivanimba.org.in
Linear : means a mathematical expression of the type-
a1x1 + a2x2 + ……….+ anxn
where a1, a2, ….., an are constants,
and x1, x2, ………, xn are variables.
Programming : refers to the process of determining
a particular program or plan of action.
Linear Programming Problem(LPP): Technique for
optimizing(maximizing/minimizing) a linear function of
variables called the ‘OBJECTIVE FUNCTION’ subject
to a set of linear equations and/or inequalities called the
‘CONSTRAINTS’ or ‘RESTRICTIONS’.
LINEAR PROGRAMMING PROBLEM
6. www.sanjivanimba.org.in
LPP Model Formulation
Objective function (Z)
It is a linear relationship reflecting the
objective of an operation
Mostly Objective function is to maximize profit
or to minimize cost.
Decision variables
Is the quantity the model needs to determine
Constraint
A linear relationship representing a restriction
on decision making
7. www.sanjivanimba.org.in
Steps in LPP Formulation
1. Define the objective. (min or max)
2. Define the decision variables.
3. Write the Objective function.
4. Write the constraints.
5. Write the Non Negativity Condition.
6. Write the LPP Model.
Note: Constraints can be in <, =, or > form.