Preface -- Introduction -- Brief History of Geometric Programming -- Theoretical Fundamentals -- The Optimal Box Design Case Study -- Trash Can Case Study -- The Building Area Design Case Study -- The Open Cargo Shipping Box Case Study -- Metal Casting Cylindrical Side Riser Case Study -- Inventory Model Case Study -- Process Furnace Design Case Study -- The Gas Transmission Pipeline Case Study -- Material Removal/Metal Cutting Economics Case Study -- Construction Building Sector Cost Minimization Case Study -- Production Function Profit Maximization Case Study -- Product Mix Profit Maximization Case Study -- Chemical Plant Product Profitability Case Study -- Journal Bearing Design Case Study -- Multistory Building Design with a Variable Number of Floors Case Study -- Multistory Building Design with a Variable Number of Floors Case Study -- Metal Casting Cylindrical Side Riser With Hemispherical Top Design Case Study -- Metal Casting Cylindrical Side Riser With Hemispherical Top Design Case Study -- Liquefied Petroleum Gas (LPG) Cylinders Case Study -- Material Removal/Metal Cutting Economics with Two Constraints Case Study -- Material Removal/Metal Cutting Economics with Two Constraints Case Study -- The Open Cargo Shipping Box with Skids Case Study -- Profit Maximization Considering Decreasing Cost Functions of Inventory Policy Case Study -- Profit Maximization Considering Decreasing Cost Functions of Inventory Policy Case Study -- Summary and Future Directions -- Theses and Dissertations on Geometric Programming -- Author's Biography -- Index.

Geometric Programming is used for cost minimization, profit maximization, obtaining cost ratios, and the development of generalized design equations for the primal variables. The early pioneers of geometric programming-Zener, Duffin, Peterson, Beightler, Wilde, and Phillips-played important roles in its development. Five new case studies have been added to the third edition. There are five major sections: (1) Introduction, History and Theoretical Fundamentals; (2) Cost Minimization Applications with Zero Degrees of Difficulty; (3) Profit Maximization Applications with Zero Degrees of Difficulty; (4) Applications with Positive Degrees of Difficulty; and (5) Summary, Future Directions, and Geometric Programming Theses & Dissertations Titles. The various solution techniques presented are the constrained derivative approach, condensation of terms approach, dimensional analysis approach, and transformed dual approach. A primary goal of this work is to have readers develop more case studies and new solution techniques to further the application of geometric programming.