01-27
Sensitivity Analysis of Vector Unconstrained Binary Quadratic Programming Problems
by Emelichev, V.A.; Girlich, E.; Nikulin, Yu.V.
Preprint series: 01-27, Preprints
- MSC:
- 90C27 Combinatorial optimization
- 90C29 Multi-objective and goal programming; vector optimization
Abstract: 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.
Keywords: multiobjective, multicriteria, discrete optimization, zero-one programming, quadratic problem, stability radius
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.