Successive Partitioning Methods
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 n → R 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.
KeywordsGlobal Optimal Solution White Vertex Good Feasible Solution Subdivision Process Extreme Direction
Unable to display preview. Download preview PDF.