Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability (Q1280987)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1263018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability |
scientific article; zbMATH DE number 1263018 |
Statements
Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability (English)
0 references
15 March 1999
0 references
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.
0 references
stability kernel
0 references
vector optimization
0 references
vector integer and noninteger programming
0 references
0.8501992225646973
0 references
0.8388916254043579
0 references
0.835774838924408
0 references
0.8337804079055786
0 references
