Hostname: page-component-cb9f654ff-qc88w Total loading time: 0 Render date: 2025-08-20T18:12:32.451Z Has data issue: false hasContentIssue false
  • English
  • Français

Geometric programming

Published online by Cambridge University Press:  22 September 2016

Robert A. Bagnato
Robert A. Bagnato*
Affiliation:
Fordham University, New York 10458
Get access Rights & Permissions [Opens in a new window]

Extract

During and after World War II, operational research teams needed new, computer-adaptable methods for optimization problems in industry, engineering, economics and the armed forces. The calculus methods developed in the sixteenth century to solve problems in astronomy, physics and geometry, even when they were applicable, were not always computer-adaptable. Among these new operational research methods is geometric programming, an optimization technique which in its beginning utilized the theorems in this article. The word “geometric” comes from its use of the geometric mean as well as geometrical concepts such as orthogonality and normalization.

Information

Type
Research Article
Information
The Mathematical Gazette , Volume 59 , Issue 407 , March 1975 , pp. 27 - 33
Copyright
Copyright © Mathematical Association 1975

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1. Zener, C., Engineering design by geometric programming. Wiley-Interscience (1971).Google Scholar
2. Zener, C., A mathematical aid in optimizing engineering designs, Proc. Natn. Acad. Sci. U.S.A. 47, 537–539 (1961).Google Scholar
3. Duffin, R., Peterson, E. and Zener, C., Geometric programming. Wiley (1967).Google Scholar
4. Duffin, R. and Peterson, E., Reports 70–38 and 71–19. Dept. of Mathematics, Carnegie-Mellon University.Google Scholar