Skip to main content

Global Solutions of Mathematical Programs with Intrinsically Concave Functions

  • Chapter
Advances in Geometric Programming

Part of the book series: Mathematical Concepts and Methods in Science and Engineering ((MCSENG,volume 21))

Abstract

An implicit enumeration technique for solving a certain type of nonconvex program is described. The method can be used for solving signomial programs with constraint functions defined by sums of quasiconcave functions and other types of programs with constraint functions called intrinsically concave functions. A signomial-type example is solved by this method. The algorithm is described together with a convergence proof. No computational results are available at present.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Avriel, M., Solution of Certain Nonlinear Programs Involving R-Convex Functions, Journal of Optimization Theory and Applications, Vol. 11, pp. 159–174, 1973.

    Article  MathSciNet  Google Scholar 

  2. Ben-Tal, A., On Generalized Means and Generalized Convexity, Journal of Optimization Theory and Applications, Vol. 21, pp. 1–13, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  3. Mangasarian, O. L., Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.

    MATH  Google Scholar 

  4. Hardy, G. H., Littlewood, J. E., and Polya, G., Inequalities, Cambridge University Press, Cambridge, England, 1952.

    MATH  Google Scholar 

  5. Mangasarian, O. L., and Klinger, A., Logarithmic Convexity and Geometric Programming, Journal of Mathematical Analysis and Applications, Vol. 24, pp. 388–408, 1968.

    Article  MathSciNet  MATH  Google Scholar 

  6. Duffin, R. J., Peterson, E. L., and Zener, C., Geometric Theory and Application, John Wiley and Sons, New York, New York, 1967.

    MATH  Google Scholar 

  7. Passy, U., Condensing Generalized Polynomials, Journal of Optimization Theory and Applications, Vol. 9, pp. 221–237, 1972.

    Article  MathSciNet  Google Scholar 

  8. Tsherniak, D., The Global Solution of Signomial Programming, Technion, Haifa, Israel, MS Thesis, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Plenum Press, New York

About this chapter

Cite this chapter

Passy, U. (1980). Global Solutions of Mathematical Programs with Intrinsically Concave Functions. In: Avriel, M. (eds) Advances in Geometric Programming. Mathematical Concepts and Methods in Science and Engineering, vol 21. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-8285-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-8285-4_18

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4615-8287-8

  • Online ISBN: 978-1-4615-8285-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics