IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v138y2008i1d10.1007_s10957-008-9366-6.html
   My bibliography  Save this article

Homotopy Method for a General Multiobjective Programming Problem

Author

Listed:
  • W. Song

    (Harbin Normal University)

  • G. M. Yao

    (Harbin College)

Abstract

In this paper, we present a combined homotopy interior-point method for a general multiobjective programming problem. The algorithm generated by this method associated to Karush–Kuhn–Tucker points of the multiobjective programming problem is proved to be globally convergent under some basic assumptions.

Suggested Citation

  • W. Song & G. M. Yao, 2008. "Homotopy Method for a General Multiobjective Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 138(1), pages 139-153, July.
    • Handle: RePEc:spr:joptap:v:138:y:2008:i:1:d:10.1007_s10957-008-9366-6
    DOI: 10.1007/s10957-008-9366-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9366-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-008-9366-6?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.

    References listed on IDEAS

    as
    1. Garth P. McCormick, 1989. "The Projective SUMT Method for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 203-223, May.
    2. Z.H. Lin & D.L. Zhu & Z.P. Sheng, 2003. "Finding a Minimal Efficient Solution of a Convex Multiobjective Program," Journal of Optimization Theory and Applications, Springer, vol. 118(3), pages 587-600, September.
    3. T. Maeda, 2004. "Second-Order Conditions for Efficiency in Nonsmooth Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 122(3), pages 521-538, September.
    4. Renato D. C. Monteiro & Ilan Adler, 1990. "An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 408-422, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    2. Giorgio, 2019. "On Second-Order Optimality Conditions in Smooth Nonlinear Programming Problems," DEM Working Papers Series 171, University of Pavia, Department of Economics and Management.
    3. P. Q. Khanh & N. D. Tuan, 2007. "Optimality Conditions for Nonsmooth Multiobjective Optimization Using Hadamard Directional Derivatives," Journal of Optimization Theory and Applications, Springer, vol. 133(3), pages 341-357, June.
    4. Vsevolod I. Ivanov, 2015. "Second-Order Optimality Conditions for Vector Problems with Continuously Fréchet Differentiable Data and Second-Order Constraint Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 777-790, September.
    5. Anulekha Dhara & Aparna Mehra, 2013. "Second-Order Optimality Conditions in Minimax Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 567-590, March.
    6. Min Feng & Shengjie Li, 2019. "Second-Order Strong Karush/Kuhn–Tucker Conditions for Proper Efficiencies in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 766-786, June.

    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:joptap:v:138:y:2008:i:1:d:10.1007_s10957-008-9366-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.