Algebraic simplex initialization combined with the nonfeasible basis method

DOI10.1016/j.ejor.2015.03.040zbMath1346.90576OpenAlexW1985180758MaRDI QIDQ319588

Hédi Nabli, Sonia Chahdoura

Publication date: 6 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.040

zbMATH Keywords

linear programmingsimplex algorithmformal tableaunonfeasible basis method

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (1)

A triangulation and fill-reducing initialization procedure for the simplex algorithm

Uses Software

• MarPlex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on ``An improved initial basis for the simplex algorithm
• An overview on the simplex algorithm
• The many facets of linear programming
• A new efficient primal dual simplex algorithm
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• A practicable steepest-edge simplex algorithm
• Linear Programming
• Linear Programming
• Two direct methods in linear programming

This page was built for publication: Algebraic simplex initialization combined with the nonfeasible basis method