Sensitivity analysis in linear semi-infinite programming via partitions

DOI10.1287/MOOR.1090.0416MaRDI QIDQ3169080zbMATH OpenOpenAlexFDO

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

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 programminglinear semi-infinite programmingoptimal value functionsensitivity analysis

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
• Post-optimal analysis of linear semi-infinite programs
• scientific article; zbMATH DE number 1163807
• Primal-dual partitions in linear semi-infinite programming with bounded coefficients
• Post-Optimal Analysis in Linear Semi-Infinite Optimization

Cited in

(17)

• Recent contributions to linear semi-infinite 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
• 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
• Optimality conditions in convex multiobjective SIP
• Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality
• Post-optimal analysis of linear semi-infinite programs
• Stochastic linear programming games with concave preferences
• scientific article; zbMATH DE number 1163807 (Why is no real title available?)
• Calmness of the optimal value in linear programming
• Strong duality and sensitivity analysis in semi-infinite linear programming
• Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach
• Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
• Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
• Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
• Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization

This page was built for publication: Sensitivity analysis in linear semi-infinite programming via partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169080)