Accession Number:

ADA009223

Title:

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

Descriptive Note:

Corporate Author:

GEORGE WASHINGTON UNIV WASHINGTON D C INST FOR MANAGEMENT SCIENCE AND ENGINEERING

Personal Author(s):

Report Date:

1975-01-07

Pagination or Media Count:

38.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE