On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance
DOI10.1137/S1052623497316798zbMATH Open1032.90522OpenAlexW2067146674MaRDI QIDQ4229487FDOQ4229487
Authors: Harvey J. Greenberg, Kees Roos, Tamás Terlaky, Allen G. Holder
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497316798
Recommendations
- Bi-parametric convex quadratic optimization
- scientific article; zbMATH DE number 1163807
- Description of the optimal solution set of the linear programming problem and the dimension formula
- Stability of linearly constrained convex quadratic programs
- Matrix perturbation and optimal partition invariancy in linear optimization
linear programmingquadratic programmingpolyhedral combinatoricspolyhedroncomputational economicsoptimal partition
Quadratic programming (90C20) Linear programming (90C05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cited In (5)
- Stability of the duality gap in linear optimization
- Title not available (Why is that?)
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Partitioning multiple objective optimal solutions with applications in radiotherapy design
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
This page was built for publication: On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229487)