Zurück zu den Preprints des Jahres 2001


Sensitivity Analysis of Vector Unconstrained Binary Quadratic Programming Problems

by Emelichev, V.A., Girlich, E., Nikulin, Yu.V..

Series: 2001-27, Preprints

90C27 Combinatorial optimization
90C29 Multi-objective and goal programming

The multiple criterion unconstrained quadratic
zero-one programming is considered. The problem of finding the Pareto
set and the problem of lexicographic optimization are studied.
Several types of stability of efficient solutions set under
'small' changes of input data are described. Borders of such
changes are ascertain. Necessary and sufficient conditions of
stability are specified.

multiobjective, multicriteria, discrete optimization, zero-one programming, quadratic problem, stability radius