Abstract: This chapter contains sections titled: Introduction Posynomial Unconstrained Minimization Problem Solution of an Unconstrained Geometric Programming Program Using Differential Calculus Solution of an Unconstrained Geometric Programming Problem Using Arithmetic–Geometric Inequality Primal–Dual Relationship and Sufficiency Conditions in the Unconstrained Case Constrained Minimization Solution of a Constrained Geometric Programming Problem Primal and Dual Programs in the Case of Less-Than Inequalities Geometric Programming with Mixed Inequality Constraints Complementary Geometric Programming Applications of Geometric Programming References and Bibliography Review Questions Problems
Publication Year: 2009
Publication Date: 2009-06-12
Language: en
Type: other
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot