Homotopy Method for a General Multiobjective Programming Problem

W. Song () and G. M. Yao
Additional contact information
W. Song: Harbin Normal University
G. M. Yao: Harbin College

Journal of Optimization Theory and Applications, 2008, vol. 138, issue 1, No 10, 139-153

Abstract: 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.

Keywords: Multiobjective programming problems; Homotopy methods; KKT conditions; Efficient solutions (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-008-9366-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:138:y:2008:i:1:d:10.1007_s10957-008-9366-6

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-008-9366-6

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().