Live Music
Archive
Librivox
Free Audio
Metropolitan Museum
Cleveland
Museum of Art
Internet
Arcade
Console Living Room
Open Library
American
Libraries
TV News
Understanding
9/11Title 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)
Technical report; 1975
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)
"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)
Technical report; 1975
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
No copyright page found. No table-of-contents pages found.
- External-identifier
-
urn:oclc:record:1041659893
![[WorldCat (this item)]](/images/worldcat-small.png "[WorldCat (this item)]")
Reviews
There are no reviews yet. Be the first one to
write a review.
238 Views
Uploaded by associate-jacob-kong on
