Abstract
In the cutting plane methods discussed in the previous chapter, the feasible domain is reduced at each step by cutting off a feasible portion that is known to contain no better solution than the current best solution.
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). Successive Approximation Methods. In: Global Optimization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02598-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-02598-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02600-7
Online ISBN: 978-3-662-02598-7
eBook Packages: Springer Book Archive