On the set of weakly efficient minimizers for convex multiobjective programming

dc.contributor.author	López, Rubén
dc.contributor.author	Vera, Cristian
dc.date.accessioned	2015-11-25T21:03:51Z
dc.date.available	2015-11-25T21:03:51Z
dc.date.issued	2008-09
dc.identifier.citation	Operations Research Letters 36 (5)	es_CL
dc.identifier.issn	0167-6377
dc.identifier.uri	http://repositoriodigital.ucsc.cl/handle/25022009/580
dc.description	Artículo de publicación ISI
dc.description.abstract	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.	es_CL
dc.language.iso	en_US	es_CL
dc.publisher	Elsevier	es_CL
dc.rights	Atribucion-Nocomercial-SinDerivadas 3.0 Chile
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.source.uri	http://goo.gl/uqx3sk
dc.subject	Multiobjective programming	es_CL
dc.subject	Set convergence	es_CL
dc.subject	Horizon limits	es_CL
dc.subject	Epigraphical convergence	es_CL
dc.subject	Asymptotic analysis	es_CL
dc.title	On the set of weakly efficient minimizers for convex multiobjective programming	es_CL
dc.type	Learning Object	es_CL

Except where otherwise noted, this item's license is described as Atribucion-Nocomercial-SinDerivadas 3.0 Chile