Research in optimization attracted attention when significant advances were made in linear programming—the optimization of a linear objective over a linear constraint set—in the late 1940s. The focus of the optimization literature continued to remain in the domain of linearity for the next couple of decades and devoted itself to advancing the field of linear programming and its subclasses (Dantzig 1963, Ahuja, Magnanti & Orlin 1993). Motivated by applications, developments in nonlinear programming algorithms followed quickly and concerned themselves mostly with local optimization guaranteeing globality under certain convexity assumptions (cf. Minoux 1986, Bazaraa, Sherali & Shetty 1993) However, problems in many areas, including engineering design, logistics, manufacturing, and the chemical and biological sciences are often modeled via nonconvex formulations and exhibit multiple local optima.


Global Optimization Algorithm Optimal Objective Function Partition Element Convex Envelope Nonconvex Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Mohit Tawarmalani
    • 1
  • Nikolaos V. Sahinidis
    • 2
  1. 1.Purdue UniversityWest LafayetteUSA
  2. 2.University of IllinoisUrbanaUSA

Personalised recommendations