Advertisement

Concavity Cuts

  • Reiner Horst
  • Hoang Tuy

Abstract

In Chapter II we discussed the general concept of a cut and the use of cuts in the basic technique of outer approximation. There, we were mainly concerned with using cuts in a “conjunctive” manner: typically, cuts were generated in such a way that no feasible point of the problem is excluded and the intersection of all the cuts contains the whole feasible region. This technique is most successful when the feasible region is a convex set, so that supporting hyperplanes can easily be constructed to separate this convex set from a point lying outside.

Keywords

Basic Solution Feasible Point Full Dimension Recession Cone Nondegenerate Case 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

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