On the strong stability of a vector trajectorial problem of the lexicographic optimization
DOI10.1515/DMA.1998.8.4.383zbMATH Open0966.90066OpenAlexW2073092236MaRDI QIDQ4522772FDOQ4522772
Authors: V. A. Emelichev, R. A. Berdysheva 
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
Recommendations
- Strong stability and strong quasistability of vector trajectorial problem of lexicographic optimization
- Some forms of stability of a combinatorial problem of lexicographic optimization
- Stability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
- On the strong stability radius of a vector trajectory problem
- scientific article; zbMATH DE number 1166378
strong stabilitypartial criteriastrong stability radiuslower attainable boundsvector trajectorial problem of lexicographic optimization
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)
Cited In (4)
- On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
- On the strong stability radius of a vector trajectory problem
- Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
This page was built for publication: On the strong stability of a vector trajectorial problem of the lexicographic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522772)
