Computability of Global Solutions to Factorable Nonconvex Programs: Part I. Convex Underestimating Problems,
GEORGE WASHINGTON UNIV WASHINGTON D C INST FOR MANAGEMENT SCIENCE AND ENGINEERING
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.
- Operations Research