A linear programming approach to geometric programs

John J. Dinkel, Gary A. Kochenberger and William H. Elliott

Naval Research Logistics Quarterly, 1978, vol. 25, issue 1, 39-53

Abstract: A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems.

Date: 1978
References: Add references at CitEc
Citations:

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

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:navlog:v:25:y:1978:i:1:p:39-53

Access Statistics for this article

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