01 ch03 Intro
01 ch03 Intro
Stefan Røpke
Rasmus Bo Bramstoft Pedersen
Richard Martin Lusby
DTU Management
Department of Technology, Management and Economics
What is Operations Research (OR)?
• Very short definition:
Application of mathematical techniques to decision making
• Examples of applications
– Planning of production: which products should be produced at
what time?
– Work planning: Which employee should be on duty at what
time?
• After the second world war the techniques were used for
peaceful purposes and accelerated due to the arrival of
computers
??
Arla
Arla
• The production of products you buy may have been planned using OR.
• When you ride on the bus, metro or the S-train OR may have been used
in the planning processes.
Real-life
system
Mathematical
Solution
model
Solution process
11 Introduction to Operations Research
Course overview
Project hand-in on
november 3rd
• Content is mainly the material covered until (and including) the project
start day. There could also be about the subject taught the following
week.
• Do the project in groups (2-3 three students in each group)
• You need to pass the project in order to attend the exam.
– Perfect project: 100 point
– Passed: 50-100 point
• There are no second attempts for passing the project.
• Your grade is only based on the exam. The mandatory assignment
does not count toward the grade.
• Multiple choice and with a few (perhaps 0) questions that require a text
answer.
• Contact:
– Email: ropke@dtu.dk
– Office 144, building 358.
• Background
– Been employed at DTU since 2008
– Professor since 2012.
– Education in Computer Science (University of Copenhagen)
– I do research in operations research.
– Is especially interested in applications within tranport and solution
methods.
– World class research in a few specific areas? My expertice
Operations
research
21 Introduction to Operations Research
Introduction to Linear programming (LP)
Programming = make a program = planning
Content of chapter 3
• 3. Introduction to LP
• 3.2 LP-model
1 2 Capacity
(hours/week)
1 1 0 4
2 0 2 12
3 3 2 18
profit 3 5
1 2 Capacity
(Hours/week)
1 1 0 4
2 0 2 12
3 3 2 18
profit 3 5
1 2 Capacity
(Hours/week)
1 1 0 4
2 0 2 12
3 3 2 18
profit 3 5
1 2 Capacity
(Hours/week)
1 1 0 4
2 0 2 12
3 3 2 18
profit 3 5
1 2 Capacity
(Hours/week)
1 1 0 4
2 0 2 12
3 3 2 18
profit 3 5
0
0 1 2 3 4 5 6
Z=30
4
Z=36
3
2
Z=21
1 Z=15
0
0 2 4 6 8 10 12
41
Personnel Scheduling - solution
42
Solve LP models using software
• See Julia slides