IA102 Linear and Integer Optimization Tasks and their Solutions

Faculty of Informatics
Autumn 2005
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
Teacher(s)
prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Petr Hliněný, Ph.D.
Timetable
Thu 10:00–11:50 B411 and each odd Thursday 14:00–15:50 B116 and each even Thursday 14:00–15:50 B411
Prerequisites
Mathematical knowledge on course levels of basic linear algebra (vectors, matrices, linear equations) and discrete mathematics (relations, graphs). Introductory knowledge of topology is also welcome.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 50 student(s).
Current registration and enrolment status: enrolled: 0/50, only registered: 0/50, only registered with preference (fields directly associated with the programme): 0/50
fields of study / plans the course is directly associated with
there are 7 fields of study the course is directly associated with, display
Course objectives
This subject presents students with basic types of optimization tasks (combinatorial, linear, and integer optimization), and teaches some basic solution methods. The main focus is on explaining and understanding the simplex method of linear optimization, and the branch-and-bound method of integer optimization. Other tasks briefly mentioned are network flows, scheduling, or TSP problems.
The lectures shall explain mathematical background used to solve those optimization problems, and the tutorials shall deal with examples of practically motivated tasks, and of optimization software usage.
Syllabus
  • The greedy algorithm and its applications.
  • Network flows with applications, duality to cuts.
  • Linear optimization (linear programming) problem.
  • Convexity and polyhedra in LP.
  • Duality of LP problems.
  • The simplex method for linear programming.
  • Implementing the simplex method.
  • Degenerated steps, looping, complexity.
  • Integer or discrete optimization problem (IP).
  • The branch-and-bound method in a shortcut.
  • Theory and implementation of branch-and-bound.
  • Combinatorial optimization problems.
  • The art of proper formulation of MIP.
  • Advanced discrete optimization topics.
Literature
  • P. Hliněný, Optimalizační úlohy, http://is.muni.cz/el/1433/podzim2005/IA102/um/OU-text05.pdf, 2005.
  • JANÁČEK, Jaroslav. Matematické Programování. Žilina, SK: EDIS Žilinská Univerzita, 2003. info
  • NEMHAUSER, George L. and Laurence A. WOLSEY. Integer and combinatorial oprimization. New York: John Wiley & Sons, 1988, 763 s. ISBN 0-471-82819-X. info
  • A. Schrijver, A Course in Combinatorial Optimization. http://homepages.cwi.nl/~lex/files/dict.pdf, CWI, Amsterdam.
Assessment methods (in Czech)
Samostatné domácí písemné projekty v průběhu semestru. Závěrečná písemná a navazující ústní zkouška.
Language of instruction
English
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2007, Spring 2009, Spring 2011.
  • Enrolment Statistics (Autumn 2005, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2005/IA102