The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
β Scribed by Mary W. Cooper
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 344 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
In this paper, both the Wolfe type and MondαWeir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established
There is a class of material processing simulators which require solution of the diffusion equation over a surface which is evolving due to some physical or chemical process related to the concentration of the diffusing species. Because of its explicit and unconditionally stable nature, the transmis