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.