LECTURE NOTE

2
Optimizing the Use of
Resources with Linear
Programming
1

OBJECTIVES

Linear Programming Basics

A Maximization Problem

A Minimization Problem

LINEAR PROGRAMMING
ESSENTIAL CONDITIONS

Adalah digunakan didalam

menyelesaikan masalah dimana kita
mempunyai resource yang terbatas
yang kita alokasikan
Model harus mempunyai fungsi
obyektif yang eksplisit
Pada umumnya memaksimalkan
keuntungan atau meminimalkan
biaya yang didasarkan pada resource
yang terbatas

COMMON APPLICATIONS

Aggregate sales and operations

planning
Service/manufacturing productivity
analysis
Product planning
Product routing
Vehicle/crew scheduling
Process control
Inventory control
4

LINEAR PROGRAMMING ESSENTIAL

CONDITIONS (CONTINUED)

Limited Resources
dialokasikan
Linearitas adalah pemodelan
yang ada dalam fungsi objektif
dan constraint (batasan)
Produk diasumsikan homogen
dan semua jam
kerja/produktifitas diasumsikan
sama
Divisibility mengasumsikan
produk dan sumber-sumber
/resource dapat dibagi
5

OBJECTIVE FUNCTION
Maximize
Maximize(or
(orMinimize)
Minimize)ZZ==CC11XX11 ++ CC22XX22 ++ ...
... ++ CCnnXXnn

Cj adalah konstanta yang

menyatakan besarnya
kontribusi untuk biaya/profit
pada setiap unit (Xj)

Z adalah total biaya atau

profit dari jumlah unit yang
dihasilkan
6

CONSTRAINTS
AA1111XX11 ++ AA1212XX22 ++ ...
... ++ AA1n1nXXnnBB11
AA2121XX11 ++ AA2222XX22 ++ ...
... ++ AA2n2nXXnnBB22
::
::

are
for each
AAAM1
+ resource
A M2XX22 ++ ...
++ AAMn
X =B
ij X
...requirements
M1X11 + AM2
MnXnn=BMM

of the related (Xj) decision variables

Bi are the available resource
requirements
Note that the direction of the
inequalities can be all or a combination
of , , or = linear mathematical
expressions
7

NON-NEGATIVITY REQUIREMENT
XX11,X
,X22,, ,
, XXnn00

All linear programming model

formulations require their decision
variables to be non-negative
While these non-negativity
requirements take the form of a
constraint, they are considered a
mathematical requirement to
complete the formulation of an LP
model

AN EXAMPLE OF A MAXIMIZATION PROBLEM

LawnGrow Manufacturing Company must determine the
unit mix of its commercial riding mower products to be
produced next year. The company produces two product
lines, the Max and the Multimax. The average profit is $400
for each Max and $800 for each Multimax. Fabrication
hours and assembly hours are limited resources. There is a
maximum of 5,000 hours of fabrication capacity available
per month (each Max requires 3 hours and each Multimax
requires 5 hours). There is a maximum of 3,000 hours of
assembly capacity available per month (each Max requires 1
hour and each Multimax requires 4 hours). Question: How
many units of each riding mower should be produced each
month in order to maximize profit?

Now
Now lets
letsformula
formulathis
thisproblem
problem as
asan
anLP
LPmodel
model
9

THE OBJECTIVE FUNCTION

If we define the Max and Multimax products as the two
decision variables X1 and X2, and since we want to
maximize profit, we can state the objective function as
follows:

Maximize Z = 400X1 + 800 X 2

Where
Z = the monthly profit from Max and Multimax
X1 = the number of Max produced each month
X 2 = the number of Multimax produced each month
10

CONSTRAINTS
Given
Giventhe
theresource
resourceinformation
informationbelow
below from
fromthe
theproblem:
problem:
Max (X1)
Required Time/Unit
3
1

Multimax (X2)
Required Time/Unit
5
4

Available Time/Month
5,000
3,000

Fab
Assy

We
Wecan
cannow
now state
statethe
theconstraints
constraintsand
andnon-negativity
non-negativity
requirements
requirementsas:
as:
3X1 + 5X 2 5,000

(Fab.)

X1 + 4X 2 3,000

(Assy.)

X1 , X 2

(Non - negativity)

Note
Note that
that the
theinequalities
inequalitiesare
areless-than-or-equal
less-than-or-equal since
since
the
thetime
timeresources
resources represent
represent the
thetotal
totalavailable
available
resources
resourcesfor
forproduction
production

11

SOLUTION

Produce
Produce 715
715 Max
Max and
and 571
571 Multimax
Multimax per
per month
month
for
for aa profit
profit of
of $742,800
$742,800

12

AN EXAMPLE OF A MINIMIZATION
PROBLEM
HiTech Metal Company is developing a plan for buying
scrap metal for its operations. HiTech receives scrap
metal from two sources, Hasbeen Industries and
Gentro Scrap in daily shipments using large trucks.
Each truckload of scrap from Hasbeen yields 1.5 tons
of zinc and 1 ton of lead at a cost of $15,000. Each
truckload of scrap from Gentro yields 1 ton of zinc and
3 tons of lead at a cost of $18,000. HiTech requires at
least 6 tons of zinc and at least 10 tons of lead per day.
Question: How many truckloads of scrap should be
purchased per day from each source in order to
minimize scrap metal costs to HiTech?
Now
Now lets
letsformula
formulathis
this problem
problem as
asan
an LP
LPmodel
model
13

THE OBJECTIVE FUNCTION

IfIf we
wedefine
definethe
theHasbeen
Hasbeentruckloads
truckloadsand
and the
the Gentro
Gentro
truckloads
truckloadsas
asthe
thetwo
twodecision
decisionvariables
variablesXX11 and
andXX22,,
and
andsince
sincewe
wewant
want to
to minimize
minimize cost,
cost,we
wecan
canstate
statethe
the
objective
objectivefunction
function as
as follows:
follows:

Minimize
Minimize ZZ == 15,000
15,000 XX11 ++ 18,000
18,000 XX22
Where
Where
ZZ== daily
dailyscrap
scrapcost
cost
XX11== cost
cost load
loadfrom
from Hasbeen
Hasbeen
XX22 == cost
cost load
loadfrom
from Gentro
Gentro

Hasbeen

Gentro
14

CONSTRAINTS
Given
Given the
thedemand
demandinformation
informationbelow
below from
fromthe
theproblem:
problem:
Hasbeen (X1)
Tons
1.5
1

Gentro (X2)
Tons
1
3

Min Tons
6
10

Zinc
Lead

We
Wecan
cannow
now state
statethe
theconstraints
constraintsand
and non-negativity
non-negativity
requirements
requirements as:
as:
1.5X
1.5X11++ XX22

>>6(Zinc/tons)
6(Zinc/tons)

XX11

>>10(Lead/tons)
10(Lead/tons)

++

XX11,,XX22

3X
3X22

>>00(Non-negativity)
(Non-negativity)

Note
Notethat
thatthe
theinequalities
inequalitiesare
are
greater-than-or-equal
since
greater-than-or-equal sincethe
the
demand
information
represents
demand information representsthe
the
minimum
necessary
for
production.
minimum necessary for production.

15

SOLUTION
Order
Order 2.29
2.29 truckloads
truckloads from
from Hasbeen
Hasbeen and
and 2.57
2.57
truckloads
truckloads from
from Gentro
Gentro for
for daily
daily delivery.
delivery. The
The daily
daily
cost
cost will
will be
be $80,610.
$80,610.

Note:
Note: Do
Do you
you see
see why
why in
in this
this solution
solution that
that
integer
integer linear
linear programming
programming methodologies
methodologies
can
can have
have useful
useful applications
applications in
in industry?
industry?

16

END OF LECTURE NOTE 2

Any Question?

17

ASSIGMENT 1
1. DIKA Bread Company produces two types of
products, namely products of T and S. Each of these
products require two kinds of raw materials, raw
material A is available 6 tons, 10 tons of material B
is available. To produce one bread S required
materials A as much as 1 kg and 2 kg of material B.
in other side, to produce of bread T need 1 kg of
material A and 1 kg of material B as well.
The selling price of bread T is Rp. 1000, - and the
bread S is Rp. 1500, -. Determine the amount of
bread T and S in order to get the maximum benefit
18

ASSIGMENT 1 (CONTINUED)
2. A baker has ingredients A, B, and C respectively each as much as 250 kg, 200 kg and 300 kg. If
the bread I need 2 kg of material A, I kg of
material B, and 1 kg of material C. While bread II
requires 1 kg of A, 2 kg of material B, and 3 kg of
material C and the bread III requires 1 kg of
material A, 1 kg of material B and 1 kg of material
C. A bread I sold at Rp 10,000,- a bread II sold at
Rp 15,000,-, and bread III sold at Rp. 10.000,-.
Determines how many bread produced in every
type of bread to in order to get maximize income?
19

Collect your assigment

On next week. 14 March 2013

20