Abstract
In this chapter, we discuss the theoretical and algorithmic issues in global optimization approaches for generalized geometric programming problems. This material is based on the work of Maranas and Floudas (1997). Section 8.1 provides an introduction to generalized geometric programming. Section 8.2 focuses on the theoretical analysis for the development of a global optimization approach. Section 8.3 presents the global optimization algorithm and its proof of convergence to an e-global optimum solution. Finally, section 8.4 presents an illustrative example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Floudas, C.A. (2000). Generalized Geometric Programming : Theory. In: Deterministic Global Optimization. Nonconvex Optimization and Its Applications, vol 37. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4949-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4949-6_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4820-5
Online ISBN: 978-1-4757-4949-6
eBook Packages: Springer Book Archive