Geometric Programming

  • Harvir Singh Kasana
  • Krishna Dev Kumar


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.


Dual Problem Expected Profit Nonlinear Programming Problem Total Annual Cost Geometric Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Harvir Singh Kasana
    • 1
  • Krishna Dev Kumar
    • 2
  1. 1.Department of MathematicsThapar Institute Engineering and TechnologyPatialaIndia
  2. 2.Department of Aerospace EngineeringKorea Advanced Institute of Science and TechnologyTaejonRepublic of Korea

Personalised recommendations