On the hierarchy of γ‐valid cuts in global optimization

Marcus Porembski

Naval Research Logistics (NRL), 2008, vol. 55, issue 1, 1-15

Abstract: Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 (1999), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20257

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:55:y:2008:i:1:p:1-15

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().