ORMS1020 Operations Research / Operaatioanalyysi, Fall / Syksy 2018
Lectures on 19th September are cancelled
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.
Lectures and exercises are pretty randomly scattered. See Opiskelijalukkari for details (requires login).
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 36:
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.
 Week 37: 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 has 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 38: 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
Preliminary schedule for the lectures:
 Wed 20180905 at 0810 F426
Orientation & Chapter 1: Selection of Optimization Problems
 Thu 20180907 at 1618 F426
Chapter 2: Short Introduction to Octave, Part I
 Mon 20180910 at 1618 F426
Chapter 2: Short Introduction to Octave, Part II
 Tue 20180911 at 1416 F426
Chapter 3: Linear Programs and Their Optima, Part I
 Wed 20180912 at 1416 F362A
Chapter 3: Linear Programs and Their Optima, Part II
 Thu 20180913 at 1214 F426
Chapter 4: Simplex Algorithm, Part I
 Mon 20180917 at 1618 F426
Chapter 4: Simplex Algorithm, Part II
 Tue 20180918 at 1416 F426
Chapter 5: Simplex Algorithm, Part III
 Wed 20180919 at 1214 F118
Chapter 5: Sensitivity and Duality, Part I
 Mon 20180924 at 1618 F426
Chapter 6: Sensitivity and Duality, Part II
 Tue 20180925 at 1618 F362A
Chapter 6: Data Envelopment Analysis, Part I
 Wed 20180926 at 1214 F426
Chapter 7: Data Envelopment Analysis, Part II
 Mon 20181001 at 1618 F426
Chapter 7: TransportationType Models, Part I
 Tue 20181002 at 1416 F426
Chapter 7: TransportationType Models, Part II
 Wed 20181003 at 1416 F426
Chapter 7: TransportationType Models, Part III
 Mon 20181008 at 1618 F426
Chapter 8: Mixed Integer Linear Programming
 Tue 20181009 at 1416 F426
Chapter 9: Mixed Integer Linear Models, The Travelling Salesman Problem
 Wed 20181010 at 1416 F426
Q & A
Exams
The dates of the final exams are
 Sat 20181027 at 1215
 Fri 20181207 at 1215
Here are some old ancient but still relevant 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.