Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
From MaRDI portal
Publication:4286621
DOI10.1137/S036301299222723XzbMath0792.90080OpenAlexW2045979166MaRDI QIDQ4286621
Publication date: 25 July 1994
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s036301299222723x
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Set-valued maps in general topology (54C60)
Related Items
On applications of the calmness moduli for multifunctions to error bounds ⋮ Error bounds for inconsistent linear inequalities and programs ⋮ From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems ⋮ Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ Error bounds for solutions of linear equations and inequalities ⋮ A note of Lipschitz constants for solutions of linear inequalities and equations ⋮ Calmness of the Optimal Value in Linear Programming ⋮ An approach to calmness of linear inequality systems from Farkas lemma ⋮ Variational relation problems: existence of solutions and fixed points of contraction mappings ⋮ Lipschitz upper semicontinuity in linear optimization via local directional convexity ⋮ Calmness of partially perturbed linear systems with an application to the central path ⋮ Quantitative stability of full random two-stage stochastic programs with recourse ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Point-based neighborhoods for sharp calmness constants in linear programming ⋮ Calmness of the argmin mapping in linear semi-infinite optimization ⋮ Solution continuity in variational conditions ⋮ On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization ⋮ Calmness of the feasible set mapping for linear inequality systems ⋮ The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program ⋮ Lipschitz modulus of the optimal value in linear programming ⋮ Stability of the extreme point set of a polyhedron ⋮ Comments on: Stability in linear optimization and related topics. A personal tour ⋮ Error bounds for mixed integer linear optimization problems
