Dynamical sensitivity analysis and its applications of simplex method for linear programming

MaRDI QIDQ5382234zbMATH OpenFDO

Authors Xianghui Meng, Xin-Sheng Hu, Bao-Chang Shi

Publication date 21 June 2019

zbMATH Keywords

linear programmingmaximal improvement rulepivot rulesensitivity analysissimplex method

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity analysis for linear programming with bounded variable and single parameter
• The sensitivity analysis of linear programming based on the improved basic line algorithm
• Sensitivity analysis in linear programming: Just be careful!
• Approaches to sensitivity analysis in linear programming
• Formulae for the sensitivity analysis of linear programming problems

Cited in

(4)

• Sensitivity analysis for linear programming with bounded variable and single parameter
• The sensitivity analysis of linear programming based on the improved basic line algorithm
• Multiple cost coefficients sensitivity theorems of integer linear optimization
• scientific article; zbMATH DE number 2188597 (Why is no real title available?)

This page was built for publication: Dynamical sensitivity analysis and its applications of simplex method for linear programming

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