Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2020/2021

Linear Programming 2

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
11LIP2 Z,ZK 3 2P+1C+10B Czech
Lecturer:
Ivan Nagy (guarantor), Pavla Pecherková
Tutor:
Ivan Nagy (guarantor), Pavla Pecherková
Supervisor:
Department of Applied Mathematics
Synopsis:

Formulation of the task of integer programming, branch and bound method of numerical solution, problems about knapsack, travelling salesman, sets, location of stores and post boxes, tasks of scheduling, heuristics, metaheuristics - genetic algorithms, ant colony optimization.

Requirements:

Basics of algebra, linear programming

Syllabus of lectures:
Syllabus of tutorials:
Study Objective:

Extension of the methods using linear optimization to tasks involving integer variables, as well. This step brings about a significant extension of the tasks solvable originaly by linear programming. The part of all tasks is a practical implementation in a software, preferably in EXCEL but also other as e.g. LiPS.

Study materials:

Alexander Schrijver: Theory of Linear and Integer Programming, ISBN-13: 978-0471982326

materials on web: fd.cvut.cz/personal/nagyivan/

Note:
Time-table for winter semester 2020/2021:
Time-table is not available yet
Time-table for summer semester 2020/2021:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2020-10-27
For updated information see http://bilakniha.cvut.cz/en/predmet6333506.html