Attempts to Calculate Global Solutions of Problems that May Have Local Minima

Abstract

Proposals for obtaining global solutions to not necessarily convex programming problems are examined with emphasis on the associated pitfalls. Included are penalty function methods, Lagrangian methods, grid methods, heuristic methods, random methods, and a branch and bound technique for separable programming problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1971
Accession Number
AD0740775

Entities

People

  • Garth Philip McCormick

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computers
  • Convex Programming
  • Convex Sets
  • Digital Computers
  • Engineering
  • Evolutionary Algorithms
  • Geometric Programming
  • Heuristic Methods
  • Intervals
  • Lagrangian Functions
  • Military Research
  • Nonconvex Programming
  • Numbers
  • Optimization
  • Quadratic Programming

Readers

  • Calculus or Mathematical Analysis
  • Systems Analysis and Design