A comparison of the primal-simplex and primal-dual algorithms for linear programming

DOI10.1145/365660.365682MaRDI QIDQ5518974zbMATH OpenOpenAlexWikidataFDO

Authors R. K. Mueller, Leon Cooper

Publication date 1965

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/365660.365682

zbMATH Keywords

operations research

Cited in

(1)

• A computational study of redundancy in randomly generated polytopes

This page was built for publication: A comparison of the primal-simplex and primal-dual algorithms for linear programming

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