Successive Partitioning Methods

  • Hoang Tuy
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 22)


One of the most frequently encountered problems of global optimization is Concave Minimization (or Concave Programming) which consists in minimizing a concave function f : R nR over a nonempty closed convex set D ( R n . In this and the next chapters we shall focus on the Basic Concave Programming (BCP) Problem which is a particular variant of the concave programming problem when all the constraints are linear, i.e. when D is a polyhedron.


Global Optimal Solution White Vertex Good Feasible Solution Subdivision Process Extreme Direction 
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 1998

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations