Abstract
With geometric programs getting larger and larger, the dual based solution methods which optimize a less complicated problem than the original problem become more important. However there are two major difficulties related to the development of a dual method. One is the non-differentiability of the dual objective function over its feasible region and the other one is the conversion of a dual solution to a primal solution. In this paper we address these issues for the posynomial programs. A well-controlled dual perturbation method which guarantees ϵ-optimal primal dual solution pair is proposed to overcome the nondifferentiability difficulty and a simple linear programming method is introduced to generate a quick dual-to-primal conversion.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
