Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions

DOI10.1287/moor.1090.0416zbMath1230.90190OpenAlexW2169696642MaRDI QIDQ3169080

Tamás Terlaky, Maxim Ivanov Todorov, Miguel Angel Goberna

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/15409

zbMATH Keywords

linear programmingsensitivity analysisoptimal value functionlinear semi-infinite programming

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Related Items (10)

Optimality conditions in convex multiobjective SIP ⋮ Stochastic linear programming games with concave preferences ⋮ Calmness of the Optimal Value in Linear Programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming

This page was built for publication: Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions