Introduction To LPP
Introduction To LPP
to
Linear Programming Problems
(LPPs)
A Presentation
By
Prof. Manidatta Ray
What is LPP ?
In mathematics, linear programming
(LP) problems involve the optimization of
a linear objective function, subject to
linear equality and inequality constraints.
Put very informally, LP is about trying to
get the best outcome (e.g. maximum
profit, least effort, etc) given some list of
constraints using a linear mathematical
model.
Components of a LP Model
The linear programming model consists of
an objective function and a set of
constraints. The quantifiable goal that is to
be maximized or minimized is the
"objective
function."
This
function
measures the effectiveness of a particular
solution
for
a
linear
programming
problem
.
The
constraints
are
mathematical statements that specify
elements of the problem such as the
limitations of available resources or a
demand level that must be met.
Importance of Linear
Programming
LP's are important - because:
Many practical problems can be
formulated as LP's
There exists an algorithm (called the
simplex algorithm) which enables
us to solve LP's numerically relatively
easily.
The common objectives for LP's are
minimise cost/ maximise profit .
Production planning
Oil refinery management
Distribution
Financial and economic planning
Manpower planning
Blast furnace burdening
Farm planning
Thank You