The sensitivity analysis of linear programming based on the improved basic line algorithm

MaRDI QIDQ3537200zbMATH OpenFDO

Authors Qiulian Fang, Guozhen Ruan, Zaiming Liu

Publication date 24 November 2008

zbMATH Keywords

basic-line algorithmlinear programmingsensitivity analysis

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity analysis for linear programming with bounded variable and single parameter
• Dynamical sensitivity analysis and its applications of simplex method for linear programming
• Sensitivity analysis in linear programming: Just be careful!
• POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
• Formulae for the sensitivity analysis of linear programming problems

Cited in

(8)

• Sensitivity analysis in linear programming: Just be careful!
• A reverse search algorithm for the neighborhood problem
• A recursive algorithm for volume-based sensitivity analysis of linear decision models
• An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region
• Sensitivity analysis for linear programming with bounded variable and single parameter
• A new geometric approach for sensitivity analysis in linear programming
• Dynamical sensitivity analysis and its applications of simplex method for linear programming
• The basic line algorithm for objective programming

This page was built for publication: The sensitivity analysis of linear programming based on the improved basic line algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537200)