The use of the optimal partition in a linear programming solution for postoptimal analysis
From MaRDI portal
Publication:1342079
DOI10.1016/0167-6377(94)90075-2zbMath0814.90077OpenAlexW2055716186MaRDI QIDQ1342079
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90075-2
Related Items
Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients, A still simpler way of introducing interior-point method for linear programming, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, Primal-dual target-following algorithms for linear programming, Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients, Consistency, redundancy, and implied equalities in linear systems, Calmness of the Optimal Value in Linear Programming, The strict complementarity in linear fractional optimization, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, On the uniqueness of optimal strategies in symmetric matrix games, On the sensitivity of the optimal partition for parametric second-order conic optimization, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Parametric analysis of semidefinite optimization, The ANALYZE rulebase for supporting LP analysis, Tolerance analysis in linear systems and linear programming, Partitioning multiple objective optimal solutions with applications in radiotherapy design, Sensitivity analysis in linear programming: Just be careful!, Multiparametric linear programming: support set and optimal partition invariancy, A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS, Analytic centers and repelling inequalities, SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM, A decomposition method for large scale MILPs, with performance guarantees and a power system application
Uses Software
Cites Work
- Redundancy in mathematical programming. A state-of-the-art survey
- Approaches to sensitivity analysis in linear programming
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Irreducibly inconsistent systems of linear inequalities
- A geometric view of parametric linear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- MINOS(IIS): Infeasibility analysis using MINOS
- Practical issues on the projection of polyhedral sets
- An analysis of degeneracy
- Incremental Linear Constraint Solving and Detection of Implicit Equalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Systems of Linear Relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
