A geometric view of parametric linear programming
From MaRDI portal
Publication:1193520
DOI10.1007/BF01758841zbMath0767.90042MaRDI QIDQ1193520
Renato D. C. Monteiro, Ilan Adler
Publication date: 27 September 1992
Published in: Algorithmica (Search for Journal in Brave)
sensitivity analysisinterior point methodspostoptimality analysisoptimal intervalparametric right-hand side linear programming
Related Items
Envelope Theorems for Multistage Linear Stochastic Optimization, The use of the optimal partition in a linear programming solution for postoptimal analysis, Two optimal value functions in parametric conic linear programming, ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs, Experimental investigations in combining primal dual interior point method and simplex based LP solvers, 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, Probability Distributions on Partially Ordered Sets and Network Interdiction Games, Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm, Primal-dual target-following algorithms for linear programming, Geometric algorithm for multiparametric linear programming, A general parametric analysis approach and its implication to sensitivity analysis in interior point methods, Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients, Consistency, redundancy, and implied equalities in linear systems, Some properties of multiple parameters linear programming, Calmness of the Optimal Value in Linear Programming, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, A new interval diagnosis method: Application to the spacecraft rendezvous phase of the Mars sample return mission, Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization, A complexity perspective on entailment of parameterized linear constraints, On the sensitivity of the optimal partition for parametric second-order conic optimization, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization, Active constraint set invariancy sensitivity analysis in linear optimization, POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING, On the finite convergence of interior-point algorithms for linear programming, Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors., Unifying optimal partition approach to sensitivity analysis in conic optimization, Parametric analysis of semidefinite optimization, Sensitivity analysis in convex quadratic optimization: invariant support set interval, Sensitivity analysis of the optimal assignment., Partitioning multiple objective optimal solutions with applications in radiotherapy design, Scheduling divisible loads with time and cost constraints, Sensitivity analysis in linear programming: Just be careful!, Fast Algorithms for Rank-1 Bimatrix Games, On parametric semidefinite programming, A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS, Sensitivity analysis in linear optimization: invariant support set intervals, Pivot versus interior point methods: Pros and cons, Degeneracy in interior point methods for linear programming: A survey, SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM, Multiparametric demand transportation problem, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, Finding an interior point in the optimal face of linear programs, An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
Cites Work
