ORMS1020 Operations Research, Fall 2019 (5 ECTS)
University of Vaasa
Lecturer / Exerciser
Tommi Sottinen /
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) and the M-files
Note that the Lecture Notes proceed in a logical order while the Actual Lectures proceed in a pedagogical order.
- Wed 2019-09-04 at 08-10 F119
Chapter 1: Selection of Optimization Problems
- Thu 2019-09-06 at 12-14 F119
Chapter 2: Short Introduction to Octave, Part I
- Fri 2019-09-07 at 08-10 F119
Chapter 2: Short Introduction to Octave, Part II
- Mon 2019-09-09 at 12-14 F119
Chapter NaN: Graphical solution of LP's. Bring graph paper!
- Tue 2019-09-10 at 12-14 F119
Chapter 3: Linear Programs and Their Optima
- Thu 2019-09-11 at 12-14 F119
Chapter 4: Simplex Algorithm, Part I
- Mon 2019-09-16 at 12-14 F119
Chapter 4: Simplex Algorithm, Part II
- Tue 2019-09-17 at 12-14 F119
Chapter 7: Transportation-Type Models, Part I
- Thu 2019-09-19 at 12-14 F119
Chapter 7: Transportation-Type Models, Part II
- Mon 2019-09-23 at 12-14 F119
Chapter 5: Sensitivity and Duality, Part I
- Tue 2019-09-24 at 12-14 F119
Chapter 5: Sensitivity and Duality, Part II
- Thu 2019-09-26 at 12-14 F119
Chapter 6: Data Envelopment Analysis, Part I
- Mon 2019-09-30 at 12-14 F119
Chapter 6: Data Envelopment Analysis, Part II
- Tue 2019-10-01 at 12-14 F119
Chapter 8: Branch-and-Bound Algorithm
- Thu 2019-10-03 at 12-14 F119
Chapter 9: Traveling Salesman Problem
- Mon 2019-10-07 at 12-14 F119
Mock Exam with help
- Tue 2019-10-08 at 12-14 F119
Mock Exam's solutions
- Thu 2019-10-10 at 14-16 F119
Q & A
Weekly Exercise Sets
The numbers after the "Exercise" refer to the
Exercises are given by Rudi Wietsma (firstname.lastname@example.org)
- 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. (To check your function, the net present value of the cash flow [1 2 3 4 5] with variable interest rates [0.1 0.2 0.3 0.4 0.5] is 7.2250.)
- Exercise 2.4.
- Exercise 2.5.
- Week 38:
Here we consider LPs, their optima and the Simplex Algorithm.
- Exercise 3.1.
- Exercise 3.3.
- Exercise 4.2.
- Exercise 4.4.
- Week 39:
Here we study Transportation-Type problems
- Exercise 7.1.
- Exercise 7.3.
- Exercise 7.4.
- Exercise 7.5.
- Week 40:
Here we study Sensitivity and Duality
- Exercise 5.2.
- Exercise 5.3.
- Exercise 5.4.
- Exercise 5.5.
- Week 41:
Here we study different topics: Data Envelopment Analysis, Branch-and-Bound Algorithm and Traveling Salesman Problem.
- Exercise 6.1.(a)
- Exercise 8.1.
- Exercise 8.2.
- Exercise 9.1.
The dates of the final exams are
- Fri 2019-10-18 at 12-15
- Fri 2019-11-29 at 12-15
Here are some 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.