IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v22y1974i3p602-609.html
   My bibliography  Save this article

Global Maximization of a Convex Function with Linear Inequality Constraints

Author

Listed:
  • Philip B. Zwart

    (Washington University, St. Louis, Missouri)

Abstract

This paper presents an algorithm for the global maximization of a convex function subject to linear inequality constraints. It is computationally finite and is designed to converge rapidly on problems in which there are few local optima or the global optimum is significantly better than most of the other local optima.

Suggested Citation

  • Philip B. Zwart, 1974. "Global Maximization of a Convex Function with Linear Inequality Constraints," Operations Research, INFORMS, vol. 22(3), pages 602-609, June.
    • Handle: RePEc:inm:oropre:v:22:y:1974:i:3:p:602-609
    DOI: 10.1287/opre.22.3.602
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.22.3.602
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.22.3.602?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    3. B. Jaumard & C. Meyer, 2001. "On the Convergence of Cone Splitting Algorithms with ω-Subdivisions," Journal of Optimization Theory and Applications, Springer, vol. 110(1), pages 119-144, July.
    4. Pooriya Beyhaghi & Thomas R. Bewley, 2016. "Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 383-415, November.
    5. Aharon Ben-Tal & Ernst Roos, 2022. "An Algorithm for Maximizing a Convex Function Based on Its Minimum," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3200-3214, November.
    6. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Aras Selvi & Aharon Ben-Tal & Ruud Brekelmans & Dick den Hertog, 2022. "Convex Maximization via Adjustable Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2091-2105, July.
    8. Queiroz, Marcelo & Humes, Carlos, 2003. "A heuristic for the continuous capacity and flow assignment," European Journal of Operational Research, Elsevier, vol. 146(3), pages 444-459, May.
    9. Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
    10. Roos, Ernst, 2021. "Robust approaches for optimization problems with convex uncertainty," Other publications TiSEM dd9e7b35-a770-4f8d-a85c-8, Tilburg University, School of Economics and Management.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:22:y:1974:i:3:p:602-609. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.