Linear Programming For BSA Students
Linear Programming For BSA Students
PROGRAMMING
L EON OR T. A M ACI O
MAT HEMATICS A N D STATISTICS DE PA RTMENT
D E L A SA L L E U N I V ERSITY-DA SMAR INAS
Beginnings
Attributed to the military service early in
World War II
History . . .
There was an urgent need to allocate scarce
resources to the various military operations and to
the activities within each operation in an effective
manner
British and US military management called upon a
large number of scientists to apply a scientific
approach to dealing with this and other strategic
and tactical problems
History . . .
By developing effective methods of using new tool
of radar, these teams were instrumental in winning
Air Battle of Britain
History . . .
With research on how to better manage convoy and
antisubmarine operations, they helped win the Battle of
the North Atlantic and Island Campaign in the Pacific
History . . .
After the war, people became aware of the use of
OR in the war efforts and that it can also be applied
to business
By the early 50s they introduced the use of OR to a
variety of organizations in business, industry and
government
In 1947, George Dantzig developed the simplex
method in solving linear programming problems
Objective of the organization
Every industrial organization faces different
problems to identify best possible solution to
their problems.
OR aims to help the executives to obtain
optimal solution with the use of OR techniques.
It also helps the decision maker to improve
his creative and judicious capabilities, analyze
and understand the problem situation leading
to better control, better co-ordination, better
systems and finally better decisions.
Linear programming
This technique is used to find a solution
for optimizing a given objective. Objective
may be maximizing profits or minimizing
costs.
Linear Programming
Objective function and Boundary conditions
are linear in nature. LPP techniques solve
Product-Mix and Distribution problems of
enterprise.
It is also used to allocate Scarce Resources in
optimum manner in problems of scheduling,
product mix, etc.
Terms
Variables
Objective
Constraints
Decision
•Feasible solution
•Optimal solution
Review of graphing linear
inequalities
Examples:
Graph the following :
1. x < 5
2. y > 8
3. 2x + 3y ≥ 6.
LP
Maximize: P = 1200x + 1600y Objective Function
3x + 2y ≤ 18 Structural constraints
2x + 4y ≤ 20
x≤5
x≥0 Non-negativity constraints
y≥ 0
Converting WP to LPP
Examples :
Models : Diet problem
Ozark Farm uses at least 800 lb of special
feed daily. The special feed is a mixture of
corn and soybean meal with the following
compositions :
lb per lb of feedstuff
Feedstuff Protein Fiber Cost ($/lb)
Corn .09 .02 .30
Soybean meal .60 .06 .90
The dietary requirements of the special feed
are at least 30% protein and at most 5%
fiber. Determine the daily minimum cost
feed mix.
Mixture
Reddy Mikks produces both interior and
exterior paints from two raw materials,
M1 and M2.
Raw Tons of raw Maximum
Materi material per ton Daily
al of Available
Exterior Interior
M1 6 4 24
M2 1 2 6
Profit 5 4
($1000)
A market survey indicates that the daily demand
for interior paint cannot exceed that for exterior
paint by more than 1 ton. Also, the maximum
daily demand for interior paint is 2 tons.
Determine the optimum product mix of interior
and exterior paints that maximizes the total daily
profit.
Production