On Some Bicriteria Problems of Discrete Optimization

Author: Zurabi Isakadze
Keywords: Bicriteria Optimization, Discrete Optimization, Assignment problem
Annotation:

Issues of solving some binary optimization problems are presented. It is shown that the sentence below stands true for a bicriteria assignment problem: There exist some instances, where we get |P(Y)| = n!. here n is a size of an instance, Y - feasible set in criterion space, P(Y) – set of Pareto optimal solutions. Numerical test results are included for the low dimension assignment problem. One practical method is considered for solving bicriteria version of project selection problem.

Lecture files:

sabakalavro nashromi-Zurabi Isakadze [ka]