Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming

DOI10.1016/0022-247X(82)90244-XzbMath0481.90086OpenAlexW1992692731MaRDI QIDQ1162457

Guy L. Curry, Don T. Phillips, Don N. Pope

Publication date: 1982

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(82)90244-x

zbMATH Keywords

closed form solutionsglobal parametric optimum solutionslinear transitionsnonserial dynamic programming problemsquadratic stage returnsserial dynamic programming problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Dynamic programming (90C39)

Related Items (2)

Approximating closed form solutions to converging branch dynamic programming problems ⋮ Optimal procedures for dynamic programs with complex loop structures

Cites Work

• Unnamed Item
• Unnamed Item
• Superposition in branching allocation problems
• On a class of convex allocation problems
• A Successive Underestimation Method for Concave Minimization Problems
• Decomposition of linear programs by dynamic programming

This page was built for publication: Closed form solutions to nonserial, nonconvex quadratic programming problems using dynamic programming