Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability
The notion of stability kernel has been introduced for vector optimization problems in graphs. We study the usefulness of an analogous concept for vector integer and noninteger programming problems. We also examine alternative definitions of the stability kernel for vector optimization problems with a bounded feasible region with and without integrality constraints.
vector integer and noninteger programming
scientific article; zbMATH DE number 1263018