COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 3. SOME PRIMAL AND DUAL ALGORITHMS FOR POSYNOMIAL AND SIGNOMIAL GEOMETRIC PROGRAMS

J G Ecker,Y Smeers,W Gochet

doi:10.1080/03052157808902387

COMPUTATIONAL ASPECTS OF GEOMETRIC PROGRAMMING 3. SOME PRIMAL AND DUAL ALGORITHMS FOR POSYNOMIAL AND SIGNOMIAL GEOMETRIC PROGRAMS

J G Ecker, Y Smeers + Show 1 more

https://doi.org/10.1080/03052157808902387

Copy DOI

Journal: Engineering Optimization	Publication Date: Jan 1, 1978
Citations: 3

Affiliation: Rensselaer Polytechnic Institute, Université Catholique de Louvain, KU Leuven

#Posynomial Programs #Signomial Programming Problems + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

In this paper we consider algorithmic and computational aspects of selected methods for posynomial and signomial programming problems. In particular, we consider the modified concave simplex method for dual posynomial programs and discuss some recent developments suggesting a new dual algorithm. We also consider linear programming based algorithms for primal posynomial programs. Finally, we discuss a recently developed branch and bound method for signomial programming.

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

Similar Papers

Paper Title

Journal

Date

Author

More From: Engineering Optimization

Paper Title

Journal

Date

Author

Disclaimer: 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.