Simplicial methods for quadratic programming
- 1 September 1964
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 11 (3-4) , 273-302
- https://doi.org/10.1002/nav.3800110304
Abstract
The article is concerned with two closely related quadratic programming methods, the Simplex and the dual method for quadratic programming. Though a self‐contained exposition of both methods is given, the article is concentrated on proofs of convergence of these methods and the properties of the Simplex tableaux.Keywords
This publication has 7 references indexed in Scilit:
- The Simplex and the Dual Method for Quadratic ProgrammingJournal of the Operational Research Society, 1964
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960
- On quadratic prorammingNaval Research Logistics Quarterly, 1959
- The Simplex Method for Quadratic ProgrammingEconometrica, 1959
- On Minimizing a Convex Function Subject to Linear InequalitiesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1955
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954