A Branch and Bound Method for Nonseparable Nonconvex Optimization.

reportActive / Technical Report | Accession Number: ADA021856 | Need Help?

Abstract:

In this paper a nonconvex programming algorithms which was developed originally for separable programming problems is formally extended to apply to nonseparable problems also. It is shown that the basic steps of the method can be modified so that separability is no restriction. Author

Author(s):
Hartman, James K.
Author Organization(s):
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Descriptive Note:
Technical rept.,
Pagination:
0013

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
NPS-55Hh75102
Task Number(s):
RR0000110
Project Number(s):
RR000-01
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*ALGORITHMS, *APPROXIMATION(MATHEMATICS), *NONLINEAR PROGRAMMING, *LAGRANGIAN FUNCTIONS, OPTIMIZATION, TRANSFORMATIONS(MATHEMATICS), SET THEORY, CONVEX SETS
Field(s)/Group(s):
Theoretical Mathematics
Keyword(s):
*Branch and bound method
Report Date:
1975 Oct 01