Linear programming

Linear Programming
• Mathematical technique used in computer
modeling (simulation) to find the best possible
solution in allocating limited resources to
achieve maximum profit or minimum cost.
– Ex.:Energy, machines, materials, money,
personnel, space, time, etc.
 Linear Programming
• Note: it is applicable only where all
relationships are linear (see linear
relationship), and can accommodate only a
limited class of cost functions
 Linear programming maximization
problem
• A small business enterprise makes dresses and
trousers. To make a dress requires 1/2 hour of
cutting and 20 minutes of stitching. To make a
trousers requires 15 minutes of cutting and
1/2 hour of stitching. The profit on a dress is
P40 and on a pair of trousers P50. The
business operates for a maximum of 8 hours
per day. Determine how many dresses and
trousers should be made to maximize profit
and what the maximum profit is.
 Linear programming minimization
problem
• Two brands of fertilizer SuperGrow and
CropedQuick are to be used in a field. The
field requires at least 16kg of nitrogen and
24kg of phosphete. SuperGrow cost $6 per
bag and Cropedquick costs $3 per bag.
SuperGrow has 2kg of nitrogen and 4 kg of
phosphate and CropedQuick has 4kg of
nitrogen and 3 kg of phospate. how much of
each brand to buy to minimize total cost of
fertiliser?
Linear programming minimization
problem
Brand Nitrogen Phosphate

SuperGrow 2 4

CropedQuick 4 3

Objective Z = 6x + 3y
Constraints 2x + 4y ≥ 16
4x + 3y ≥ 24
 Sample exercises 1
• A farmer has 80 hectares of his farm available
for planting maize and cabbages. He must
grow at least 10 hectares of maize and 20
hectares of cabbages to meet demands. He
prefers to plant more cabbages than maize
but his work force and equipment will only
allow him to cultivate a maximum of three
times the quantity of cabbages to that of
maize.
 Sample exercises 1
• If the profit on maize is P800 per ha and on
cabbages P500 per ha, how should the farmer
plant the two crops to make a maximum profit
and what is this profit.
 Sample exercises 2
• A factory makes two types of beds, type A and
type B. Each month x of type A and y of type B
are produced. The following constraints
control monthly production:
– Not more than 50 beds of type A and 40 beds of
type B can be made.
– To show a profit at least 60 beds in all must be
made.
 Sample exercises 2
– The maximum number of beds that can be
produced is 80.
– If the objective function is given by the equation y
= -2x + P/150 , where P is the monthly profit in
pesos, what is the profit per bed of the two types
of bed?