Sensitivity analysis for linear programming with bounded variable and single parameter
From MaRDI portal
Publication:3501236
zbMATH Open1150.90498MaRDI QIDQ3501236FDOQ3501236
Authors: Xiaopeng Wei, Jinbao Jian 
Publication date: 3 June 2008
Recommendations
- Formulae for the sensitivity analysis of linear programming problems
- Approaches to sensitivity analysis in linear programming
- Dynamical sensitivity analysis and its applications of simplex method for linear programming
- Some observations on the perturbation of the vectors \(b\) and \(c\) in a linear programming problem.
- The sensitivity analysis of linear programming based on the improved basic line algorithm
Cited In (14)
- Some observations on the perturbation of the vectors \(b\) and \(c\) in a linear programming problem.
- Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program
- Dynamical sensitivity analysis and its applications of simplex method for linear programming
- The sensitivity analysis of linear programming based on the improved basic line algorithm
- Strictly sensitivity analysis for linear programming problems with upper bounds
- Title not available (Why is that?)
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
- Title not available (Why is that?)
- Linear programming sensitivity measured by the optimal value worst-case analysis
- Sensitivity of the optimal solution of a linear programming problem to variations of the matrix elements
- Title not available (Why is that?)
- Sensitivity analysis of an agricultural linear programming model
- Sensitivity analysis in bilevel linear programming
This page was built for publication: Sensitivity analysis for linear programming with bounded variable and single parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501236)
