Computational study of the GDPO dual phase-1 algorithm

DOI10.1007/s10287-009-0094-7zbMath1185.90150OpenAlexW2091229585MaRDI QIDQ970138

István Maros

Publication date: 10 May 2010

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-009-0094-7

zbMATH Keywords

piecewise lineardual simplex

Mathematics Subject Classification ID

Linear programming (90C05)

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A piecewise linear dual phase-1 algorithm for the simplex method
• Steepest-edge simplex algorithms for linear programming
• Computational techniques of the simplex method
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
• Pivot selection methods of the Devex LP code

This page was built for publication: Computational study of the GDPO dual phase-1 algorithm