ORMS1020 Operations Research / Operaatioanalyysi, Fall / Syksy 2016
Huom:
Luennot ovat suomeksi, mutta kaikki materiaali on englanniksi.
Kokeissa ja harjoituksissa voi vastata joko suomeksi tai englanniksi.

N.B.
Lectures are in Finnish, but all the material is in English.
In the exams and the exercises you may answer either in Finnish or
in English.

N.B.
The STATUS parameter shas been changed in glpk for Octave version 4.0.3. Therefore the status parameter in stu_lp_solver is incorrect.
Huom:
Kurssin luentomuistiinpanojen linkki Matti Laaksosen suomenkielisiin operaatioanalyysin luentomuistiinpanoihin on virheellinen. Oikea linkki on http://lipas.uwasa.fi/~mla/orms1020/oamoniste2012.pdf.
Lecturer
Tommi Sottinen
Scope
5 cr
Contents
Linear modeling;
solving linear programs with Octave;
simplex algorithm;
sensitivity analysis and duals for linear programs;
data envelopment analysis; transportation problems;
assignment problems;
transshipment problems;
mixed integer linear programming;
branchandbound algorithm;
traveling salesman problem;
fixedcharge problem;
setcovering problem.
Course Material
Lecture notes
ORMS 1020: Operations Research
with GNU Octave (October 19, 2011) by Tommi Sottinen and the Mfiles
Weekly Exercise Sets
The numbers after "Exercise" refer to the
Lecture notes.
 Week 37:
In the first exercise set we get a first glimpse of the
GNU Octave programming language.
See pages 1427 of the Lecture Notes
or Octave
Manual to get help for these exercises.
 Make Octave print "Hello World!" to the screen.
(Type help disp to get help, or if you are a C programmer,
type help printf.)
 Exercise 2.1.
 Exercise 2.2.
 Make Octave give a wrong answer due to rounding errors.
 Visualize the "grading function"
round( max( 0, min(10p4, 5) ) )
where
and a is your percentage of points from the exam and
b is the percentage of the exercises you have completed,
by using the Octave's plotting functions.
(This exercise is very demanding. See Octave
Manual: Plotting for help. Also typing help contourf may be useful.)
 Week 38: In the second exercise set we get a first glimpse of optimization
problems and study programming with GNU Octave.
 Exercise 1.2.
 Exercise 2.3.
 Exercise 2.4.
 Exercise 2.5.

The STATUS parameter shas been changed in glpk for Octave version 4.0.3. Therefore the status parameter in stu_lp_solver is incorrect. Correct this bug for the function stu_lp_solver.
 Week 39: Here we consider LPs and their optima, and our our implementation of the Simplex Algorithm.
 Exercise 3.1.
 Exercise 3.2.
 Exercise 3.3.
 Exercise 4.1.
 Make the following Octave function (mfile). The function takes a matrix as its input parameter. It returns the input matrix where all but the first row and the last column are replaced by zeros.
 Week 40: Here we study the Simplex Algorithm, and sensitivity and duality.
 Exercise 4.4.
 Exercise 4.5.
 Exercise 5.2.
 Exercise 5.3.
 Exercise 5.5.
 Week 41: Here we study Data Envelopment Analysis and Transportation Problems.
 Exercise 6.1.
 Exercise 6.2.
 Exercise 7.1.
 Exercise 7.3.
 Exercise 7.4.
 Week 42: Here we study Transportationtype problems, Integer programming (IP) and the traveling salesman problem.
 Exercise 7.5.
 Exercise 8.1.
 Exercise 8.2.
 Exercise 9.1.
 Find a mistake in the lecture notes.
Lectures
 Wed 1416 F118 (week 36)
 Wed 1416 F141 (weeks 3741)
 Thu 1012 F118 (week 36)
 Thu 1012 F141 (weeks 3740)
 Thu 1012 F426 (week 41)
 Fri 1012 F426 (week 36)
 Fri 1012 F141 (weeks 3741)
Preliminary schedule for the lectures:
 Wednesday  Thursday  Friday

Week 36:  Orientation  Chapters 12  Chapter 2

Week 37:  Chapters 23  Chapter 3  Chapters 34

Week 38:  Chapter 4  Chapter 4  Chapters 45

Week 39:  Chapter 5  Chapter 6  Chapter 6

Week 40:  Chapter 7  Chapter 7  Chapter 7

Week 41:  Chapter 8  Chapter 9  Canceled

Exercises
 1. Tue 1416 TF4109 (weeks 3740, 42)
 1. Tue 1214 TF4109 (week 41)
 2. Wed 1618 TF3102 (weeks 3742) English group
 3. Thu 0810 TF4109 (weeks 3742)
 4. Thu 1416 TF4109 (weeks 3742)
Exams
The dates of the final exams are (most likely)
 Fri Oct 28 at 1215
 Sat Dec 10 at 1215
Here are some old final exams with solutions:
Grading
Your grade will be given by the formula
round( max( 0, min(10p4, 5) ) )
where
and a is your percentage of points from the exam and
b is the percentage of the exercises you have completed.
The additional points b are not transferable beyond the first final exam you take
after the course, i.e. then b=0.