Abstract
Geometric programming is very efficient to determine the optimal solutions of highly nonlinear programming problems. Moreover, this concept has a very wide range of applications for dealing with mechanical and industrial engineering processes. Different types of geometric programming problems have been considered in this chapter.
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kasana, H.S., Kumar, K.D. (2004). Geometric Programming. In: Introductory Operations Research. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-08011-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-08011-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07270-3
Online ISBN: 978-3-662-08011-5
eBook Packages: Springer Book Archive