ORMS1020 Operations Research / Operaatioanalyysi, Fall / Syksy 2018
Lectures on 19th September are cancelled
Luennot ovat suomeksi, mutta kaikki materiaali on englanniksi.
Kokeissa ja harjoituksissa voi vastata joko suomeksi tai englanniksi.
Lectures are in Finnish, but all the material is in English.
In the exams and the exercises you may answer either in Finnish or
Lectures and exercises are pretty randomly scattered. See Opiskelijalukkari for details (requires login).
solving linear programs with Octave;
sensitivity analysis and duals for linear programs;
data envelopment analysis; transportation problems;
mixed integer linear programming;
traveling salesman problem;
ORMS 1020: Operations Research
with GNU Octave (October 19, 2011) by Tommi Sottinen, and the M-files
Weekly Exercise Sets
The numbers after "Exercise" refer to the
- Week 36:
In the first exercise set we get a first glimpse of the
GNU Octave programming language.
See pages 14-27 of the Lecture Notes
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 (m-file). 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 Transportation-type 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.
Preliminary schedule for the lectures:
- Wed 2018-09-05 at 08-10 F426
Orientation & Chapter 1: Selection of Optimization Problems
- Thu 2018-09-07 at 16-18 F426
Chapter 2: Short Introduction to Octave, Part I
- Mon 2018-09-10 at 16-18 F426
Chapter 2: Short Introduction to Octave, Part II
- Tue 2018-09-11 at 14-16 F426
Chapter 3: Linear Programs and Their Optima, Part I
- Wed 2018-09-12 at 14-16 F362A
Chapter 3: Linear Programs and Their Optima, Part II
- Thu 2018-09-13 at 12-14 F426
Chapter 4: Simplex Algorithm, Part I
- Mon 2018-09-17 at 16-18 F426
Chapter 4: Simplex Algorithm, Part II
- Tue 2018-09-18 at 14-16 F426
Chapter 5: Simplex Algorithm, Part III
- Wed 2018-09-19 at 12-14 F118
Chapter 5: Sensitivity and Duality, Part I
- Mon 2018-09-24 at 16-18 F426
Chapter 6: Sensitivity and Duality, Part II
- Tue 2018-09-25 at 16-18 F362A
Chapter 6: Data Envelopment Analysis, Part I
- Wed 2018-09-26 at 12-14 F426
Chapter 7: Data Envelopment Analysis, Part II
- Mon 2018-10-01 at 16-18 F426
Chapter 7: Transportation-Type Models, Part I
- Tue 2018-10-02 at 14-16 F426
Chapter 7: Transportation-Type Models, Part II
- Wed 2018-10-03 at 14-16 F426
Chapter 7: Transportation-Type Models, Part III
- Mon 2018-10-08 at 16-18 F426
Chapter 8: Mixed Integer Linear Programming
- Tue 2018-10-09 at 14-16 F426
Chapter 9: Mixed Integer Linear Models, The Travelling Salesman Problem
- Wed 2018-10-10 at 14-16 F426
Q & A
The dates of the final exams are
- Sat 2018-10-27 at 12-15
- Fri 2018-12-07 at 12-15
Here are some old ancient but still relevant exams with solutions:
Your grade will be given by the formula
round( max( 0, min(10p-4, 5) ) )
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.