A branch and bound method for nonseparable nonconvex optimization
By: by James K. Hartman
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1975
Place of publication: Monterey, Calif
Language: eng
Number of pages: 11
Subjects: Branch and bound algorithms; Mathematical optimization; Convex programming
Description: 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)
Notes: Title from cover.

"Prepared for: Office of Naval Research, Arlington, Virginia 22217"--Cover.

"October 1975"--Cover.

"NPS-55Hh75102"--Cover.

Author(s) subject terms:Linear programming, nonconvex, optimization, branch and bound.

Includes bibliographical references (p. 10)

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1975.