Module Overview

Integer Programming

This module expands on the fundamental concepts of Operations Research and Linear Programming. This module introduces a number of Integer Programming methods, including branch and bound, cutting planes, and network simplex.

Module Code

MATH 4820

ECTS Credits


*Curricular information is subject to change

Definition of Integer Programming
Formulations, discrete/integer, types(network, transportation, location problems, set covering).
Greedy algorithms
Knapsack, travelling salesman heuristic, location problems.
Branch and bound algorithm
Linear relaxation, fathoming, branching, incumbent solution, discrete/ integer problems.
Cutting plane methods
Redundancy, tightening methods.
Network Simplex
Independence, basic feasible solutions, basic/nonbasic arcs, algorithm, optimality tests.

Lectures supported by tutorials

Module Content & Assessment
Assessment Breakdown %
Formal Examination100