Comparative Analysis of Different Types of Stability with Respect to Constraints of a Vector Integer-Optimization Problem.

Autor: T. T. Lebedeva, T. I. Sergienko
Zdroj: Cybernetics & Systems Analysis; Jan2004, Vol. 40 Issue 1, p52-57, 6p
Abstrakt: The problem of finding the Pareto set among integer points of a convex polyhedron is considered in the paper. Various types of stability of this multicriterion problem to changes of initial data under constraints are analyzed. Necessary and sufficient conditions for different types of stability with respect to constraints are obtained. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: