Professional Documents
Culture Documents
Various types of LP
LECTURER
Instructor : Boni Sena Contact : 0856-9-2423-611 (Only for class representative by phone or SMS) Email : boni.sena@binus.ac.id Web : binusmaya.binus.ac.id Text book :
Ernest F. Haussler, Richard S. Paul, Richard J. Wood, Introductory Mathematical Analysis, Prentice Hall P. Rama Murthy, Operations Research, New Age International Frederick S. Hiller, Gerald J. Lieberman, Introduction to operations research, Mc-Graw Hill Hamdy A. Taha, Operations research : an introduction, Pearson Prentice Hall
CLASS IS LIKE..
POINT OF EVALUATION
Exams (70%)
35% (midterm) 35% (final) 15% 15% (Quiz will be held every two weeks)
Assignment (30%)
Problem ?
Governor of Jakarta want to make MRT. Can you help them to design the track of MRT ?
Boni Sena, 2013
TRAFFIC JAM
How to solve traffic jam ?
Where to deploy radiotheraphy to maximize impact On carcinogenic cells and minimize damage in Other cells ?
Mathematics
Problem
Algorithm
Minimize the effort
Linear Programming
Model
Stochastic
Statistic
LINEAR PROGRAMMING
Linear Programming A model which is used for solving optimization problems under such assumptions as certainty, linearity, fixed technology and constant profit per unit [8]
Decision Variable
Component of LP [2]
Objective function
Constraints
Boni Sena, 2013
LP MODEL FORMULATION
Decision variables
Objective function
Constraint
TYPES OF LP [2]
TYPES OF LP (CONT.)
TYPES OF LP (CONT.)
subject to constraints : a11x1 + a12x2 + ... + a1nxn (, =, ) b1 a21x1 + a22x2 + ... + a2nxn (, =, ) b2 : am1x1 + am2x2 + ... + amnxn (, =, ) bm xj = decision variables bi = constraint levels cj = objective function coefficients aij = constraint coefficients
EXAMPLE OF LP
Z = 4 x1 + 7 x2 Subject to 9 x1 + 4 x2 100 7 x1 + x2 60 x 1 , x2 0
Objective function
Constraints
2.
3.
Identify the decision variables Quantify the decision consequences to be maximized or minimized through Objective Function What limits decisions? Formulate the constraints
MAXIMIZATION PROBLEM
RESOURCE REQUIREMENTS
PRODUCT Bowl Mug Labor (hr/unit) 1 2 Clay (lb/unit) 4 3 Revenue ($/unit) 40 50
There are 40 hours of labor and 120 pounds of clay available each day
Maximize Z = 40 x1 + 50 x2
Subject to x1 + 2x2 40 hr (labor constraint) 4x1 + 3x2 120 lb (clay constraint) x1 , x2 0
MINIMIZATION PROBLEM
CHEMICAL CONTRIBUTION
Brand Nitrogen (lb/bag) Phosphate (lb/bag)
Gro-plus Crop-fast
2 4
4 3
Minimize the production cost to buy nitrogen and phosphate every day. The cost of nitrogen $ 6/day and the cost of phosphate $ 3/day. There are 16 lb of Nitrogen and 24 lb of phosphate available each day Decision variables x1 = number of nitrogen x2 = number of phosphate
Boni Sena, 2013
Minimize Z = $6x1 + $3x2 subject to 2x1 + 4x2 16 lb of nitrogen 4x1 + 3x2 24 lb of phosphate x 1, x 2 0
REFERENCES
1.
2.
3.
4.
5.
Andrs Ramos, 2012. Operation Research and Optimization Techniques. Lecture Notes. Universidad Pontificia Comillas Beni Asllani. 2006. Linear Programming. Lecture Notes. University of Tennessee. John Wiley & Sons, Inc. Ernest F. Haussler, Richard S. Paul, Richard J. Wood, Introductory Mathematical Analysis, Prentice Hall Frederick S. Hiller, Gerald J. Lieberman, Introduction to operations research, Mc-Graw Hill Hamdy A. Taha. Operations research : an introduction, Pearson Prentice Hall
REFERENCES
6.
7.
8.
9.
Jong Jek Siang. 2011. Riset Operasi Dalam Pendekatan Algoritmis. Yogyakarta, Andi K. Gita Ayu. 2011. An Introduction to deterministic optimization. Lecture Notes. Bina Nusantara University. (Available at binusmaya.binus.ac.id) P. Rama Murthy, Operations Research, New Age International Rosihan Asmara. Operation Research : Linear Programming. Lecture Notes. Brawijaya University