A Branch and Bound Method for Nonseparable Nonconvex Optimization.
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Pagination or Media Count:
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
- Theoretical Mathematics