1980•Naval Research Logistics QuarterlyRequires access

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

Mary W. Cooper

Abstract

Abstract This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply‐constrained problem.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Separable space, Mathematical optimization, Nonlinear system, Nonlinear programming, Class (philosophy), Constraint (computer-aided design), Mathematics, Function (biology)