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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of optimization theory and applications Ročník 138; číslo 1; s. 139 - 153
Hlavní autoři:	Song, W., Yao, G. M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.07.2008 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!