Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming

Robert A. Abrams
Additional contact information
Robert A. Abrams: Northwestern University, Evanston, Illinois

Operations Research, 1976, vol. 24, issue 2, 325-335

Abstract: This paper gives a method by which any consistent geometric programming problem may be reduced to a superconsistent or unconstrained geometric programming problem. We show that a consistent geometric programming problem is not superconsistent if and only if the dual geometric programming problem has an unbounded optimal solution set or an unattained supremum. Reduction of the dual to canonical form, i.e., reduction to an equivalent problem with a bounded optimal solution set, is shown to be dual to the reduction of a consistent primal program to an equivalent superconsistent program.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.2.325 (application/pdf)

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:inm:oropre:v:24:y:1976:i:2:p:325-335

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().