Solving Nonlinear Problems In Communication Systems Using Geometric Programming And Dualities

Solving Nonlinear Problems in Communication Systems Using Geometric Programming and Dualities

Geometric Programming for Communication Systems

Recently Geometric Programming has been applied to study a variety of problems in the analysis and design of communication systems from information theory and queuing theory to signal processing and network protocols. Geometric Programming for Communication Systems begins its comprehensive treatment of the subject by providing an in-depth tutorial on the theory, algorithms, and modeling methods of Geometric Programming. It then gives a systematic survey of the applications of Geometric Programming to the study of communication systems. It collects in one place various published results in this area, which are currently scattered in several books and many research papers, as well as to date unpublished results. Geometric Programming for Communication Systems is intended for researchers and students who wish to have a comprehensive starting point for understanding the theory and applications of geometric programming in communication systems.

Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition

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.