论文信息 - A polynomially bounded algorithm for a singly constrained quadratic program - 字舞流文

A polynomially bounded algorithm for a singly constrained quadratic program

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.

Jeffery L. Kennington | Richard V. Helgason | H. S. Lall | R. Helgason | J. Kennington | H. Lall

[1] A. Charnes,et al. The Theory of Search: Optimum Distribution of Search Effort , 1958 .

[2] K. Srikantan. A Problem in Optimum Allocation , 1963 .

[3] Lalitha Sanathanan,et al. On an Allocation Problem with Multistage Constraints , 1971, Oper. Res..

[4] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

[5] Hanan Luss,et al. Technical Note - Allocation of Effort Resources among Competing Activities , 1975, Oper. Res..

[6] J. Kennington,et al. An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems , 1977 .

[7] Arnoldo C. Hax,et al. On the Solution of Convex Knapsack Problems with Bounded Variables. , 1977 .

[8] A. Ali,et al. Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms , 1980, Oper. Res..