Approaches to sensitivity analysis in linear programming
From MaRDI portal
Publication:757255
DOI10.1007/BF02055188zbMath0722.90075MaRDI QIDQ757255
Richard E. Wendell, James E. Ward
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Fuzzy non-linear integer program by parametric programming approach, Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients, Additive and multiplicative tolerance in multiobjective linear programming, Multiparametric linear programming: support set and optimal partition invariancy, Structural approach to parametric analysis of an IP. On the case of the right-hand side, Stability aspects of the traveling salesman problem based on \(k\)-best solutions, Sensitivity analysis in linear programming: Just be careful!, Degeneracy in interior point methods for linear programming: A survey, The use of the optimal partition in a linear programming solution for postoptimal analysis, Pivot versus interior point methods: Pros and cons, Sensitivity analysis of the optimal assignment., Metamodelling techniques in multidimensional optimality analysis for linear programming, Generalized linear fractional programming under interval uncertainty, Construction of the largest sensitivity region for general linear programs, A fresh view on the tolerance approach to sensitivity analysis in linear programming, SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM, Monitoring and prioritising alerts for exception analytics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Objective function bounds for the inexact linear programming problem with generalized cost coefficients
- Survey of solved and open problems in the degeneracy phenomenon
- A preview of a tolerance approach to sensitivity analysis in linear programming
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Inexact linear programming with generalized resource sets
- A Note on Shadow Prices in Linear Programming
- Linear parametric programming—A brief survey
- Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
- On linear multiparametric optimization with parameter-dependent constraint matrix
- Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
- The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming: General Perturbations
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- An analysis of degeneracy
- The Computation of Shadow Prices in Linear Programming
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
- An Approach to Sensitivity Analysis
- Technical Note—Exact Solutions of Inexact Linear Programs
- A construction method in parametric programming
- The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- A Technique for Resolving Degeneracy in Linear Programming
- On stochastic linear programming distribution problems, stochastic technology matrix
- Sensitivitätsanalysen und parametrische Programmierung
- Multiparametric Linear Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming