Linear Programming: A Survey of General Purpose Algorithms
- 1 September 1975
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 7 (3) , 212-221
- https://doi.org/10.1080/05695557508975005
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Solution of the complex linear complementarity problemJournal of Mathematical Analysis and Applications, 1973
- Surrogated Linear ProgrammingA I I E Transactions, 1973
- A mutual primal‐dual linear programming algorithmNaval Research Logistics Quarterly, 1970
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- A comparison of the primal-simplex and primal-dual algorithms for linear programmingCommunications of the ACM, 1965
- Generalized Inverse Computations Using the Gradient Projection MethodJournal of the ACM, 1964
- The dual simplex algorithm for bounded variablesNaval Research Logistics Quarterly, 1958
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954