Computability of Global Solutions to Factorable Nonconvex Programs: Part I. Convex Underestimating Problems,
Abstract:
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.
Security Markings
DOCUMENT & CONTEXTUAL SUMMARY
Distribution:
Approved For Public Release
RECORD
Collection: TR