Successive Partition Methods

  • Reiner Horst
  • Hoang Tuy


This chapter is devoted to a class of methods for concave minimization which investigate the feasible domain by dividing it into smaller pieces and refining the partition as needed (successive partition methods, branch and bound).


Global Optimal Solution Convex Envelope Longe Edge Conical Algorithm Concave Minimization 
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-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Reiner Horst
    • 1
  • Hoang Tuy
    • 2
  1. 1.Department of MathematicsUniversity of TrierTrierGermany
  2. 2.Institute of MathematicsVien Toan HocHanoiVietnam

Personalised recommendations