The bounded variable problem‐an application of the dual method for quadratic programming
- 1 June 1965
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 12 (2) , 173-179
- https://doi.org/10.1002/nav.3800120205
Abstract
The paper presents an algorithm to solve the bounded variable quadratic programming problem. The algorithm is a direct extension of an earlier algorithm of H. Wagner (N.R.L.Q. 1958) for the case of a bounded variable linear programming problem.Keywords
This publication has 4 references indexed in Scilit:
- Simplicial methods for quadratic programmingNaval Research Logistics Quarterly, 1964
- The dual simplex algorithm for bounded variablesNaval Research Logistics Quarterly, 1958
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear ProgrammingEconometrica, 1955
- The dual method of solving the linear programming problemNaval Research Logistics Quarterly, 1954