The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

DOI10.1002/nav.3800270108zbMath0432.90064OpenAlexW2082119062MaRDI QIDQ3870680

Mary W. Cooper

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270108

zbMATH Keywords

nonlinear integer programmingdynamic programmingcomputational experienceseparable objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39)

Related Items

A branch and bound algorithm for solving separable convex integer programming problems ⋮ Unnamed Item ⋮ Parametric nonlinear integer programming: The right-hand side case ⋮ An efficient algorithm for multi-dimensional nonlinear knapsack problems ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems