Homotopy Method for a General Multiobjective Programming Problem

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 assumpti...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications Vol. 138; no. 1; pp. 139 - 153
Main Authors: Song, W., Yao, G. M.
Format: Journal Article
Language:English
Published: Boston Springer US 01.07.2008
Springer
Springer Nature B.V
Subjects:
Algorithms
Applications of Mathematics
Applied sciences
Basic converters
Calculus of Variations and Optimal Control; Optimization
Engineering
Exact sciences and technology
Linear programming
Mathematical programming
Mathematics
Mathematics and Statistics
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Pareto optimum
Programming
Theory of Computation
Multiobjective programming problems
Efficient solutions
Homotopy methods
KKT conditions
Efficiency
KKT conditions
Homotopy
Karush Kuhn Tucker method
Multiobjective programming
Interior point method
Efficient solutions
Non linear programming
ISSN:0022-3239, 1573-2878
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-008-9366-6