On a Method of Solving Bi-Criteria Partitioning Problem

Author: Bezhan Ghvaberidze
Co-authors: Bidzina Matsaberidze
Keywords: Partitioning problem, bi-criteria discrete optimization, ε-constraint method.
Annotation:

We present a method of solving a bi-criteria partitioning problem using ε-constraint method. It’s shown that the method generates weakly efficient solutions and in case of its uniqueness, efficiency (Pareto-optimality) of the solution is guaranteed. A numerical example is also presented

Lecture files:

On a Method of Solving Bi-Criteria Partitioning Problem [en]
დაყოფის ორკრიტერიუმიანი ამოცანის ამოხსნის ერთი მეთოდის შესახებ [ka]