Standard Article

Geometric Programming

  1. T. R. Jefferson,
  2. C. H. Scott

Published Online: 13 JUN 2008

DOI: 10.1002/9780470050118.ecse537

Wiley Encyclopedia of Computer Science and Engineering

Wiley Encyclopedia of Computer Science and Engineering

How to Cite

Jefferson, T. R. and Scott, C. H. 2008. Geometric Programming. Wiley Encyclopedia of Computer Science and Engineering. 1–13.

Author Information

  1. University of California, Irvine, Irvine, California

Publication History

  1. Published Online: 13 JUN 2008

Abstract

Since its initial appearance more than four decades ago, geometric programming has proved itself to be a powerful means of solving many optimization problems, particularly those that pertain to engineering design. The theory has been generalized to provide a structure for the analysis of any convex programming problem. Here we trace the development of geometric programming from its initial use as a trick for solving certain cost-optimization problems to its current status as a fully fledged branch of optimization theory. Examples drawn from inventory theory and engineering reinforce and motivate this development.

Keywords:

  • optimization;
  • geometric;
  • programs;
  • posynomial;
  • signomial