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

A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization

Author

Listed:
  • G. V. Loganathan

    (Virginia Polytechnical Institute and State University, Blacksburg, Virginia)

  • Hanif D. Sherali

    (Virginia Polytechnical Institute and State University, Blacksburg, Virginia)

Abstract

This paper presents an interactive cutting-plane algorithm for determining a best-compromise solution to a multiobjective optimization problem in situations with an implicitly defined utility function. We derive cutting planes that are based on suitable pairwise trade-offs between the objective functions, as prescribed by the decision maker at each iterate generated by the algorithm. The proposed algorithm requires no line searches, and generates iterates that are all contained in the efficient frontier. This feature facilitates the preference judgment of the decision maker, and permits an analyst to terminate short of optimality with an efficient near-optimal solution. A convergence analysis establishes that any accumulation point generated by the algorithm is a best-compromise solution. We also conduct an error analysis to point out the effect of inconsistencies in trade-off information provided by the decision maker. The algorithm may be extended to situations involving nonconvex feasible regions, as well as nonconcave (for a max problem) objective functions. We offer remarks for such cases, and describe an application to an urban runoff control-design problem.

Suggested Citation

  • G. V. Loganathan & Hanif D. Sherali, 1987. "A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization," Operations Research, INFORMS, vol. 35(3), pages 365-377, June.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:3:p:365-377
    DOI: 10.1287/opre.35.3.365
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.3.365
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.3.365?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. Asim Roy & Jyrki Wallenius, 1991. "Nonlinear and unconstrained multiple‐objective optimization: Algorithm, computation, and application," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 623-635, August.
    2. Aksoy, Yasemin & Butler, Timothy W. & Minor, Elliott D., 1996. "Comparative studies in interactive multiple objective mathematical programming," European Journal of Operational Research, Elsevier, vol. 89(2), pages 408-422, March.
    3. Vieira, D.A.G. & Lisboa, A.C., 2019. "A cutting-plane method to nonsmooth multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 822-829.

    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:35:y:1987:i:3:p:365-377. 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.