Computable Methods for Obtaining Global Solutions to Nonconvex Programming Problems Which are Factorable.

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0773372

Entities

People

  • Garth Philip McCormick

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Nonconvex Programming
  • Nonlinear Programming
  • Operations Research

Fields of Study

  • Mathematics

Readers

  • Operations Research