A4 Refereed article in a conference publication

On a quasistability radius for multicriteria integer linear programming problem of finding extremum solutions




AuthorsEmelichev Vladimir, Nikulin Yury

EditorsCherepynets V.

Conference nameInternational Conference on High Performance Computing

Publishing placeKyiv

Publication year2018

Book title Fifth International Conference on High Performance Computing (HPC-UA 2018)

First page 27

Last page35

ISBN978-966-7690-16-8

Web address http://hpc-ua.org/hpc-ua-18/proceedings/(external)

Self-archived copy’s web addresshttps://research.utu.fi/converis/portal/detail/Publication/36624652(external)


Abstract

We consider a multicriteria problem of integer linear programming with a targeting set of optimal solutions given by the set of all individual criterion minimizers (extrema). In this work, the lower and upper attainable bounds on the quasistability radius of the set of extremum solutions are obtained in the situation where solution and criterion spaces are endowed with various Hölder’s norms. As corollaries, an analytical formula for the quasistability radius is specified in the case where criterion space is endowed with Chebyshev’s norm. Some computational challenges are also discussed.


Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 19:51