Generalized γ-Valid Cut Procedure for Concave Minimization

H. P. Benson
Additional contact information
H. P. Benson: University of Florida

Journal of Optimization Theory and Applications, 1999, vol. 102, issue 2, No 5, 289-298

Abstract: Abstract The concept of a γ-valid cutting plane has been used in many types of algorithms for solving concave minimization problems. Unfortunately, the procedures proposed to date for constructing these cuts are valid only under certain assumptions that often may not hold in practice. Chief among these is the requirement that the feasible region of the concave minimization problem in question have full dimension, and that the objective function of this problem be concave rather than quasiconcave. In this article, we propose, validate, and show how to implement a more general γ-valid cutting plane procedure which eliminates these restrictions.

Keywords: Concave minimization; γ-valid cut; Tuy cut; global optimization (search for similar items in EconPapers)
Date: 1999
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021776323080 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:102:y:1999:i:2:d:10.1023_a:1021776323080

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021776323080

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().