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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horst, R., Tuy, H. (1990). Concavity Cuts. In: Global Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02598-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-02598-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02600-7
Online ISBN: 978-3-662-02598-7
eBook Packages: Springer Book Archive