An algorithm for concave integer minimization over a polyhedron

Harold P. Benson and S. Selcuk Erenguc

Naval Research Logistics (NRL), 1990, vol. 37, issue 4, 515-525

Abstract: We present an algorithm for solving the problem of globally minimizing a concave function over the integers contained in a compact polyhedron. The objective function of this problem need not be separable or even analytically defined. To our knowledge, the algorithm is the first ever proposed for this problem. Among the major advantages of the algorithm are that no nonlinear computations or optimizations are required, and that it allows one to exploit the polyhedral nature of X. We discuss these and other advantages and disadvantages of the algorithm, and we present some preliminary computational experience using our computer code for the algorithm. This computational experience seems to indicate that the algorithm is quite practical for solving many concave integer minimization problems over compact polyhedra.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-X

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:37:y:1990:i:4:p:515-525

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 ().