Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability
From MaRDI portal
(Redirected from Publication:1280987)
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.
Recommendations
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
- scientific article; zbMATH DE number 2059046
- Different types of stability of vector integer optimization problem: General approach
- Vector optimization problems: Stability in the decision space and in the space of alternatives
- On a quantitative measure of stability for a vector problem in integer programming
Cited in
(4)- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Perturbed cones for analysis of uncertain multi-criteria optimization problems
- Stability kernel of a multicriteria optimization problem under perturbations of input data of the vector criterion
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
This page was built for publication: Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280987)
