Binary variable, criterion, restriction for continuous variable, restriction for discrete variable, specific tasks of integer programmingary variables, integer variables, mixed variables, practical implementation.
Abstract:
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.
Objectives:
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.