Stability of the extreme point set of a polyhedron
From MaRDI portal
Publication:2565018
Recommendations
Cites work
- A Characterization of Stability in Linear Programming
- A Lipschitzian Characterization of Convex Polyhedra
- A note on the continuity of solutions of parametric linear programs
- Convex Analysis
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 194348 (Why is no real title available?)
- Linear parametric programming—A brief survey
- On Perturbations in Systems of Linear Inequalities
- Optimization algorithms and point-to-set-maps
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(8)- Combinatorial behavior of extreme points of perturbed polyhedra
- Lipschitz-continuity of Pareto-optimal extreme points
- The conditional stability of extreme points of a polyhedral set
- Extreme points of well-posed polytopes
- scientific article; zbMATH DE number 796450 (Why is no real title available?)
- On the Stability of the Extreme Point Set in Linear Optimization
- Stability of Brocard points of polygons
- Extreme points of discrete location polyhedra
This page was built for publication: Stability of the extreme point set of a polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565018)