Skip to main content
Log in

A counterexample to a global optimization algorithm

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A counterexample to an algorithm of Dien (1988) for solving a minimization problem with a quasiconcave objective function and both linear and a reverse-convex constraint shows that this algorithm needn't lead to a solution of the given problem.

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.

Institutional subscriptions

Similar content being viewed by others

References

  • Dien, L. V. (1988), Minimizing a quasiconcave function subject to a reverse convex constraint,Appl. Math. Optim. 18, 231–240.

    Google Scholar 

  • Engel, O. (1992), Zur Behandlung von nichtlinearen Optimierungsproblemen mit Booleschen Variablen. Diplomarbeit, TH Ilmenau.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borchardt, M., Engel, O. A counterexample to a global optimization algorithm. J Glob Optim 5, 371–372 (1994). https://doi.org/10.1007/BF01096686

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Navigation