#### Facts about the course

ECTS Credits:
7.5
Responsible department:
Faculty of Logistics
Course Leader:
Mohamed Ben Ahmed
Lecture Semester:
Spring
Teaching language:
English
Duration:
½ year

# LOG733 Exact Optimization Methods in Logistics (Spring 2022)

## About the course

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.

## Recommended requirements

LOG716 Mathematical Modelling in logistics is highly recommended. Some mathematical or quantitative background is needed.

## The student's learning outcomes after completing the course

After having completed the course, the students should be able to:

• Represent and solve linear programming problems with two variables using the graphical method
• Execute the simplex algorithm in tabular form to solve linear programming problems
• Find the dual of a linear programming problem, and explain the relationships between the primal and the dual
• Use the dual simplex method to solve linear programming problems and explain its relationship to the primal simplex method
• Solve integer programming problems and binary integer programming problems using branch-and-bound with LP-relaxations being solved using the (dual) simplex method
• Generate Gomory cuts and solve integer programming problems using a cutting plane algorithm
• Formulate and solve deterministic problems using dynamic programming

## Forms of teaching and learning

3 hours of lectures per week.

## Coursework requirements - conditions for taking the exam

• Mandatory coursework: Assignment(s)
• Courseworks given: 2
• Courseworks required: 2
• Presence: Not required
• Comment: There will be two mandatory assignments, both needs to be passed in order to take the final exam.

## Examination

• Form of assessment: Written school assessment
• Proportion: 100%
• Duration: 4 Hours
• Grouping: Individual
• Grading scale: Letter (A - F)
• Support material: Calculator with empty memory + general dictionary in mother tongue/Norwegian/English in paper version

## Syllabus

Required reading list is given in fronter at the semester start

Relevant literature:
Wayne L. Winston and Munirpallam Venkataramanan. 2003. Introduction to Mathematical Programming. Thomson/Brooks/Cole. 4th edition.

Last updated from FS (Common Student System) Sep. 17, 2021 8:20:23 PM