Sensitivity analysis in linear programming: Just be careful!

DOI10.1016/S0377-2217(96)00172-5zbMath0929.90081OpenAlexW2048137492MaRDI QIDQ1278928

Benjamin Jansen, J. J. de Jong, Tamás Terlaky, Cornelis Roos

Publication date: 28 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00172-5

zbMATH Keywords

Lagrange multiplierssensitivity analysis

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients, Generalized average shadow prices and bottlenecks, Sensitivity analysis with finite changes: an application to modified EOQ models, Construction of the largest sensitivity region for general linear programs, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm, Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients, Computing shadow prices with multiple Lagrange multipliers, Sensitivity analysis for bottleneck assignment problems, Directional shadow price in linearly constrained nonconvex optimization models, Informative Lagrange multipliers in nonlinear parametric programming models, Parametric LP for sensitivity analysis of efficiency in MOLP problems, A labeling algorithm for the sensitivity ranges of the assignment problem, Capacity optimization and competition with cyclical and lead-time-dependent demands, Active constraint set invariancy sensitivity analysis in linear optimization, Global sensitivity analysis via a statistical tolerance approach, POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING, Interior Point Methods for Nonlinear Optimization, A global tolerance approach to sensitivity analysis in linear programming, An easy way to teach interior-point methods., Sensitivity analysis in convex quadratic optimization: invariant support set interval, Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization, Sensitivity analysis of the optimal assignment., Tolerance analysis in linear systems and linear programming, Partitioning multiple objective optimal solutions with applications in radiotherapy design, Multiparametric linear programming: support set and optimal partition invariancy, Fast Algorithms for Rank-1 Bimatrix Games, A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS, Sensitivity analysis in linear optimization: invariant support set intervals, A reverse search algorithm for the neighborhood problem, Pivot versus interior point methods: Pros and cons, SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Approaches to sensitivity analysis in linear programming
• A new polynomial-time algorithm for linear programming
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• A geometric view of parametric linear programming
• The use of the optimal partition in a linear programming solution for postoptimal analysis
• A Note on Shadow Prices in Linear Programming
• An analysis of degeneracy
• Ouelques Precisions Sur Les Prix Marginaux En Programmation Lineaire^*
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem