Skip to main content
Log in

On a decomposition for a special class of geometric programming problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Optimization of physical systems consisting of interrelated subsystems which can be formulated as geometric programming problems is considered. Necessary and sufficient conditions are derived for decomposing the optimization of a special class of such systems into a sequence of subsystem optimizations. An example is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Zener, C.,A Mathematical Aid in Optimizing Engineering Designs, Proceedings of the National Academy of Sciences, Vol. 47, No. 6, 1961.

  2. Duffin, R. J., Peterson, E. L., andZener, C.,Geometric Programming—Theory and Applications, John Wiley and Sons, New York, 1967.

    Google Scholar 

  3. Zener, C.,Minimization of System Costs in Terms of Subsystem Costs, Proceedings of the National Academy of Sciences, Vol. 51, No. 2, 1964.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. A. Howard

This research was completed at the Mobil Research and Development Corporation, Central Research Division Laboratory, Princeton, New Jersey.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heymann, M., Avriel, M. On a decomposition for a special class of geometric programming problems. J Optim Theory Appl 3, 392–409 (1969). https://doi.org/10.1007/BF00929355

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00929355

Keywords

Navigation