Abstract
This paper presents a characterization of the solutions of a singly constrained quadratic program. This characterization is then used in the development of a polynomially bounded algorithm for this class of problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Ali, R. Helgason, J. Kennington and H. Lall, “Solving multicommodity network flow problems”,Operations Research, to appear.
G.R. Bitran and A.C. Hax, “On the solution of convex knapsack problems with bounded variables”, in: A. Prékopa, ed.,Survey of mathematical programming, Vol. 1 (North-Holland, Amsterdam, 1979) pp. 357–367.
A. Charnes and W.W. Cooper, “The theory of search: optimum distribution of search effort”,Management Science 5 (1958) 44–50.
M. Held, P. Wolfe and H. Crowder, “Validation of subgradient optimization”,Mathematical Programming 6 (1974) 62–88.
J. Kennington and M. Shalaby, “An effective subgradient procedure for minimal cost multicommodity flow problems”,Management Science 23 (1977) 994–1004.
E.L. Lawler,Combinatorial optimization: networks and matroids (Holt, Rinehart, and Winston, New York, 1976).
H. Luss and S.K. Gupta, “Allocation of effort resources among competing activities”,Operations Research 23 (1975) 360–365.
C.J. McCallum Jr., “An algorithm for certain quadratic integer programs”, Bell Laboratories Technical Report, Holmdel, NJ (undated).
L. Sanathanan, “On an allocation problem with multistage constraints”,Operations Research 19 (1971) 1647–1663.
K.S. Srikantan, “A problem in optimum allocation”,Operations Research 11 (1963) 265–273.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Helgason, R., Kennington, J. & Lall, H. A polynomially bounded algorithm for a singly constrained quadratic program. Mathematical Programming 18, 338–343 (1980). https://doi.org/10.1007/BF01588328
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588328