An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region

DOI10.1504/IJMOR.2013.057489zbMath1390.90528OpenAlexW2056543148MaRDI QIDQ1635378

Publication date: 6 June 2018

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

Full work available at URL: https://doi.org/10.1504/ijmor.2013.057489

zbMATH Keywords

linear programming artificial-free feasible direction method pivoting algorithm big-M free full gradient simplex algorithm largest sensitivity region simplex standard-form free

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

This page was built for publication: An interior boundary pivotal solution algorithm for linear programmes with the optimal solution-based sensitivity region