Abstract: Various real problems can be modeled as multicriteria optimization problems (MOP). In the general case, there is no single solution that optimizes all the criteria, but there is a set of solutions where improvement in the value of one criterion leads to deterioration in the value of at least another criterion. This set is known as a Pareto optimal set and any element of this set could be the final solution of the MOP. In order to select the final solution, additional information is necessary and it is supplied by the so-called decision maker. The quality of the interactive algorithms for solving MOP depends mainly on the scalarizing problems they are designed and based on. The scalarizing problems of the reference neighborhood, which are presented in the paper, are especially appropriate for solving multiobjective linear integer programming problems.

Keywords: Multicriteria Linear Integer Optimization, Scalarizing problem.

ACM Classification Keywords: G.1.6. Optimization – Integer Programming

Link:

REFERENCE-NEIGHBOURHOOD SCALARIZATION FOR MULTIOBJECTIVE INTEGER LINEAR PROGRAMMING PROBLEMS

Krassimira Genova, Mariana Vassileva

http://foibg.com/ibs_isc/ibs-16/ibs-16-p09.pdf