Permutations in the Factorization of Simplex Bases

DOI10.1287/ijoc.2018.0862OpenAlexW2944641123WikidataQ127897766 ScholiaQ127897766MaRDI QIDQ5139619

Ricardo Fukasawa, Laurent Poirrier

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7e59140fdd992599da25c3f21c99277fea600051

zbMATH Keywords

linear programmingsimplex methodfactorization updatebasis factorization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• MIPLIB
• CPLEX
• Gurobi
• Benchmarks for Optimization Software
• CLP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• A fast LU update for linear programming
• Steepest-edge simplex algorithms for linear programming
• Computational techniques of the simplex method
• Novel update techniques for the revised simplex method
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• The simplex method of linear programming using LU decomposition

This page was built for publication: Permutations in the Factorization of Simplex Bases