Accession Number : AD0773372
Title : Computable Methods for Obtaining Global Solutions to Nonconvex Programming Problems Which are Factorable.
Descriptive Note : Intermim rept.,
Corporate Author : GEORGE WASHINGTON UNIV WASHINGTON D C DEPT OF OPERATIONS RESEARCH
Personal Author(s) : McCormick,Garth P.
Report Date : SEP 1973
Pagination or Media Count : 39
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, and as a subalgorithm to a new global vertification procedure which establishes that a local minimizer is a global minimizer. (Author)
Descriptors : *Nonlinear programming, Inequalities, Convex sets, Algorithms
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE