IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v53y2001i3p419-433.html
   My bibliography  Save this article

Multiobjective duality for convex-linear problems II

Author

Listed:
  • Gert Wanka
  • Radu-Ioan Boţ

Abstract

A multiobjective programming problem characterized by convex goal functions and linear inequality constraints is studied. The investigation aims to the construction of a multiobjective dual problem permitting the verification of strong duality as well as optimality conditions. For the original primal problem properly efficient (minimal) solutions are considered. This allows to deal with the linearly scalarized programming problem. Different from the usual Lagrange dual problem a dual problem for the scalarized is derived applying the Fenchel-Rockafellar duality approach and using special and appropriate perturbations. The dual problem is formulated in terms of conjugate functions. That dual problem has the advantage that its structure gives an idea for the formulation of a multiobjective dual problem to the original problem in a natural way. Considering efficient (maximal) solutions for that vector dual problem it succeeds to prove the property of so-called strong duality. Moreover, duality corresponds with necessary and sufficient optimality conditions for both the scalar and the multiobjective problems. Copyright Springer-Verlag Berlin Heidelberg 2001

Suggested Citation

  • Gert Wanka & Radu-Ioan Boţ, 2001. "Multiobjective duality for convex-linear problems II," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(3), pages 419-433, July.
    • Handle: RePEc:spr:mathme:v:53:y:2001:i:3:p:419-433
    DOI: 10.1007/s001860000104
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000104
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000104?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. R. I. Boţ & S. M. Grad & G. Wanka, 2006. "Fenchel-Lagrange Duality Versus Geometric Duality in Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 33-54, April.

    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:spr:mathme:v:53:y:2001:i:3:p:419-433. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.