Combinatorial behavior of extreme points of perturbed polyhedra

DOI10.1016/0022-247X(87)90145-4zbMath0634.90077OpenAlexW2052040794MaRDI QIDQ1097175

Robert G. Batson

Publication date: 1987

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(87)90145-4

zbMATH Keywords

stability theoryEuclidean distancepolyhedral convex sets

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Polytopes and polyhedra (52Bxx)

Related Items (1)

Nonatomic aggregative games with infinitely many types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to sensitivity and stability analysis in nonlinear programming
• Extensions of Radstrom's lemma with application to stability theory of mathematical programming
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Rates of Stability in Nonlinear Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Stability in Nonlinear Programming
• Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
• Point-to-Set Maps in Mathematical Programming

This page was built for publication: Combinatorial behavior of extreme points of perturbed polyhedra