Treffer: Homotopy Method for a General Multiobjective Programming Problem
Title:
Homotopy Method for a General Multiobjective Programming Problem
Source:
Journal of optimization theory and applications. 138(1):139-153
Publisher Information:
New York, NY: Springer, 2008.
Publication Year:
2008
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Efficacité, Efficiency, Eficacia, Homotopie, Homotopy, Homotopía, Méthode Karush Kuhn Tucker, Karush Kuhn Tucker method, Método Karush Kuhn Tucker, Méthode point intérieur, Interior point method, Método punto interior, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Programmation non linéaire, Non linear programming, Programación no lineal, Efficient solutions, Homotopy methods, KKT conditions, Multiobjective programming problems
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, Harbin Normal University, Harbin 150080, China
Department of Mathematics, Harbin College, Harbin, China
Department of Mathematics, Harbin College, Harbin, China
ISSN:
0022-3239
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.20479377
Database:
PASCAL Archive
Weitere Informationen
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.