Solving worrying simplex's instances in polynomial time

MaRDI QIDQ4982576zbMATH OpenFDO

Authors Babacar Mbaye Ndiaye, Ivan Lavallée, D. Seck

Publication date 9 April 2015

zbMATH Keywords

basic feasible solutionsdichotomyhyperplaneKlee-Minty's linear programminglinear programming (LP)polynomial complexity

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 4016589
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 2208706
• scientific article; zbMATH DE number 428033
• Linear Programming in O([n3/ln n]L) Operations

This page was built for publication: Solving worrying simplex's instances in polynomial time

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