On the strong stability of a vector trajectorial problem of the lexicographic optimization
From MaRDI portal
Publication:4522772
DOI10.1515/dma.1998.8.4.383zbMath0966.90066OpenAlexW2073092236MaRDI QIDQ4522772
R. A. Berdysheva, Vladimir A. Emelichev
Publication date: 14 August 2001
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1998.8.4.383
strong stabilitypartial criteriastrong stability radiuslower attainable boundsvector trajectorial problem of lexicographic optimization
Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items (2)
On five types of stability of the lexicographic variant of the combinatorial bottleneck problem ⋮ Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
This page was built for publication: On the strong stability of a vector trajectorial problem of the lexicographic optimization
