Computable Methods for Obtaining Global Solutions to Nonconvex Programming Problems Which are Factorable.
GEORGE WASHINGTON UNIV WASHINGTON D C DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented. This is used to exclude from consideration regions where the global minimizer cannot exist, and as a subalgorithm to a new global vertification procedure which establishes that a local minimizer is a global minimizer. Author
- Operations Research