Finding a Minimal Efficient Solution of a Convex Multiobjective Program

Z.H. Lin, D.L. Zhu and Z.P. Sheng
Additional contact information
Z.H. Lin: Jilin University
D.L. Zhu: Fudan University
Z.P. Sheng: Northeast Normal University

Journal of Optimization Theory and Applications, 2003, vol. 118, issue 3, No 6, 587-600

Abstract: Abstract In this paper, we construct an interior-point homotopy method for solving a minimal efficient solution of a convex multiobjective program. Some examples are shown.

Keywords: Convex multiobjective programs; minimal efficient solutions; interior-point methods; global convergence; parametrized Sard theorem (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOTA.0000004872.93803.09 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:118:y:2003:i:3:d:10.1023_b:jota.0000004872.93803.09

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

DOI: 10.1023/B:JOTA.0000004872.93803.09

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 ().