Computability of Global Solutions to Factorable Nonconvex Programs: Part I. Convex Underestimating Problems,

reportActive / Technical Report | Accession Number: ADA009223 | Need Help?

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.

Author(s):
Mccormick, Garth P.
Author Organization(s):
GEORGE WASHINGTON UNIV WASHINGTON D C INST FOR MANAGEMENT SCIENCE AND ENGINEERING
Pagination:
0038

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
Serial, AFOSR-TR-75-0562
Contract/Grant Number(s):
AF-AFOSR-2504-73
Task Number(s):
974906
Project Number(s):
AF-9749
Monitor Series:
TR-75-0562
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*NONLINEAR PROGRAMMING, COMPUTATIONS, RECURSIVE FUNCTIONS, CONVEX SETS, THEOREMS, INEQUALITIES
Field(s)/Group(s):
Operations Research
Keyword(s):
Global problems, Convex programming, Factorable programming
Report Date:
1975 Jan 07