A complete constructive algorithm for the general mixed linear programming problem

DOI10.1002/NAV.3800120102MaRDI QIDQ5557599zbMATH OpenOpenAlexFDO

Authors Glenn W. Graves

Publication date 1965

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800120102

zbMATH Keywords

operations research

Cited in

(7)

• Degeneracy in the presence of roundoff errors
• Dynamic factorization in large-scale optimization
• Cascading-heuristics for the solution of staircase linear programs
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A practical anti-cycling procedure for linearly constrained optimization
• A bump triangular dynamic factorization algorithm for the simplex method
• The factorization approach to large-scale linear programming

This page was built for publication: A complete constructive algorithm for the general mixed linear programming problem

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