Accession Number:

ADA021856

Title:

A Branch and Bound Method for Nonseparable Nonconvex Optimization.

Descriptive Note:

Technical rept.,

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF

Personal Author(s):

Report Date:

1975-10-01

Pagination or Media Count:

13.0

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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE