Result: On the set of weakly efficient minimizers for convex multiobjective programming

Title:
On the set of weakly efficient minimizers for convex multiobjective programming
Source:
Operations research letters. 36(5):651-655
Publisher Information:
Amsterdam: Elsevier, 2008.
Publication Year:
2008
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Depto. de Matemática y Rsica Aplicadas, Universidad Católica de la Santfsima Concepción, Concepción 4090541, Chile
ISSN:
0167-6377
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
Notes:
Operational research. Management
Accession Number:
edscal.20662823
Database:
PASCAL Archive

Further Information

In this paper by employing an asymptotic approach we develop an existence and stability theory for convex multiobjective programming. We deal with the set of weakly efficient minimizers. To this end we employ a notion of convergence for vector-valued functions close to that due to Lemaire.