dc.creator | Osuna Gómez, Rafaela | es |
dc.creator | Hernández Jiménez, Beatriz | es |
dc.creator | Chalco Cano, Yurilev | es |
dc.creator | Ruiz Garzón, Gabriel | es |
dc.date.accessioned | 2022-10-27T10:42:40Z | |
dc.date.available | 2022-10-27T10:42:40Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Osuna Gómez, R., Hernández Jiménez, B., Chalco Cano, Y. y Ruiz Garzón, G. (2017). New efficiency conditions for multiobjective interval-valued programming problems. Information Sciences, 420, 235-248. https://doi.org/10.1016/j.ins.2017.08.022. | |
dc.identifier.issn | 0020-0255 | es |
dc.identifier.issn | 1872-6291 | es |
dc.identifier.uri | https://hdl.handle.net/11441/138425 | |
dc.description.abstract | In this paper, we focus on necessary and sufficient efficiency conditions for optimization
problems with multiple objectives and a feasible set defined by interval-valued functions.
A new concept of Fritz-John and Karush–Kuhn–Tucker-type points is introduced for this
mathematical programming problem based on the gH-derivative concept. The innovation
and importance of these concepts are presented from a practical and computational point
of view. The problem is approached directly, without transforming it into a real-valued
programming problem, thereby attaining theoretical results that are more powerful and
computationally more efficient under weaker hypotheses. We also provide necessary conditions for efficiency, which have been inexistent in the relevant literature to date. The
identification of necessary conditions is important for the development of future computational optimization techniques in an interval-valued environment. We introduce new generalized convexity notions for gH-differentiable interval-valued problems which are a generalization of previous concepts and we prove a sufficient efficiency condition based on
these concepts. Finally, the efficiency conditions for deterministic programming problems
are shown to be particular instances of the results proved in this paper. The theoretical
developments are illustrated and justified through several numerical examples. | es |
dc.format | application/pdf | es |
dc.format.extent | 14 p. | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Information Sciences, 420, 235-248. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Multiobjective programming | es |
dc.subject | Interval-valued functions | es |
dc.subject | Generalized Hukuhara differentiability | es |
dc.subject | Fritz–John and Karush–Kuhn–Tucker | es |
dc.subject | Efficiency conditions | es |
dc.title | New efficiency conditions for multiobjective interval-valued programming problems | es |
dc.type | info:eu-repo/semantics/article | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa | es |
dc.relation.publisherversion | https://doi.org/10.1016/j.ins.2017.08.022 | es |
dc.identifier.doi | 10.1016/j.ins.2017.08.022 | es |
dc.journaltitle | Information Sciences | es |
dc.publication.volumen | 420 | es |
dc.publication.initialPage | 235 | es |
dc.publication.endPage | 248 | es |