LOG733 Exact Optimization Methods in Logistics
LOG716 Mathematical Modelling in logistics is highly recommended. Some mathematical or quantitative background is needed.
The course will mainly focus on solving problems from logistics formulated as deterministic optimization models. Examples of problems include production problems, shortest path and knapsack problems. Modeling will be covered only briefly, as this is supposed to be known in advance. Problems treated include Linear Programming (LP) problems and Discrete Optimization problems. Emphasis will be put on the Simplex algorithm for Linear Programming and Branch and Bound search for discrete problems, but dynamic programming and other solution methods will also be treated.
After having completed the course, the candidate is supposed to:
- Be able to solve linear programming problems by using the simplex method
- Be able to solve integer and mixed integer programming problems by using the Branch-and-Bound method
- Understand the connection between the primal and the dual of an LP, and know how to convert problems from one of the formulations to the other
- Be able to use dynamic programming to solve simple problems suited for this method
3 hours of lectures per week.
Required reading list is given in fronter at the semester start
Wayne L. Winston and Munirpallam Venkataramanan. 2003. Introduction to Mathematical Programming. Thomson/Brooks/Cole. 4th edition.
|Obligatorisk arbeidskrav||Antall arbeidskrav||Påkrevde arbeidskrav||Fremmøte||Kommentar|
|Oppgave(r)||2||2||Ikke påkrevd||There will be two mandatory assignments, both needs to be passed in order to take the final exam. |
|Kommentar:||There will be two mandatory assignments, both needs to be passed in order to take the final exam. |
|Skriftlig skoleeksamen||Individuell||4||Timer||Bokstavkarakter||100||Kalkulator som kan inneholde data + generell ordbok morsmål/norsk/engelsk i papirformat|
|Hjelpemidler:||Kalkulator som kan inneholde data + generell ordbok morsmål/norsk/engelsk i papirformat|