Abstract
The refined, or strong duality theory of posynomial geometric programming is a comprehensive duality theory which does not depend on the Kuhn-Tucker theorem or on the superconsistency of the primal. It is also used to classify geometric programs into categories that possess certain distinctive attributes. In this paper an alternative and mathematically simpler approach to this theory is presented. The approach is based upon a reformulation of the dual as a generalized linear program, and the derivation of the results is based primarily upon principles in linear optimization.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
