Standard Article

Geometric Programming

  1. Jayant Rajgopal

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0358

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Rajgopal, J. 2011. Geometric Programming. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. University of Pittsburgh, Department of Industrial Engineering, Pittsburgh, Pennsylvania

Publication History

  1. Published Online: 15 FEB 2011

Abstract

Geometric programming (GP) constitutes a special class of nonlinear optimization problems involving objective and constraint functions that are stated in the form of generalized polynomials. While the field is only about 50 years old, it has been studied extensively. This article reviews the important theoretical and computational aspects of GP and also discusses extensions to the original form that have been developed over the years.

Keywords:

  • geometric programming;
  • nonlinear programming;
  • convex programming;
  • optimization;
  • posynomials;
  • signomials;
  • generalized polynomials