LINEAR

PROGRAMMING
MODELS
(LP)
Linear Programming
Generalized Linear Programming
Models
Solutions to LP Models by Graphical
Methods
Solutions to LP Models by Simplex
Methods

Big M Method

Duality in LP Models
Introduction of LP Models
It was in 1947 that George
Dantzig and his associates found
Afterwards, Dantzig
out a technique for solving suggested this approach
military planning problems while for solving business and
they were working on a project
for US Air Force. industrial problems.
 This technique
consisted of
Dantzig also
representing the
developed the most
various activities of
powerful
an organization as a
mathematical tool
Linear Programming
known as “Simplex
model and arriving at
Method” to solve
the optimal program
linear programming
by minimizing/
problem.
maximizing a linear
objective function.
Linear Programming is a widely used
mathematical modeling technique to
determine the optimum allocation of
scarce resources among competing
demands.
Resources typically include raw
materials, manpower, machinery, money,
time and space etc.
As its name implies, the linear
programming model consists of linear
objectives and linear constraints, which
means that the variables in a
model have a proportionate relationship.

For example, an increase in labour resource

(input) will result an increase in production
(output).
 FORMULATION
Objective • Maximization
• Minimization
Function
Constraints • ≤ (Max. Availability)
• ≥ (Min. Requirement)
(Conditions) • = (Standard)

Non • (always)
Negativity •≥0