Geometric programming for design and cost optimization with illustrative case study problems and solutions /

• Main Author: Creese, Robert C., 1941-
• Format: Electronic
• Language: English
• Published: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, c2010.
• Series: Synthesis lectures on engineering (Online), # 10.
• Subjects: Geometric programming.
• Online Access: View fulltext via EzAccess
• Item Description: Part of: Synthesis digital library of engineering and computer science.; Title from PDF t.p. (viewed on November 4, 2009).; Series from website.
• Physical Description: 1 electronic text (ix, 70 p. : ill.) : digital file.; Also available in print.
• Format: Mode of access: World Wide Web.; System requirements: Adobe Acrobat reader.
• Bibliography: Includes bibliographical references (p. 67-68) and index.
• ISBN: 9781608452637 (electronic bk.)
• ISSN: 1939-523X
• Access: Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Geometric programming is used for design and cost optimization and the development of generalized design relationships and cost rations for specific problems. The early pioneers of the process, Zener, Duffin, Peterson, Beightler, and Wilde, played important roles in the development of geometric programming. The theory of geometric programming is presented and 10 examples are presented and solved in detail. The examples illustrate some of the difficulties encountered in typical problems and techniques for overcoming these difficulties. The primal-dual relationships are used to illustrate how to determine the primal variables from the dual solution. These primal-dual relationships can be used to determine additional dual equations when the degrees of difficulty are positive. The goal of this work is to have readers develop more case studies to further the application of this exciting mathematical tool.