Generalized multiobjective robustness and relations to set-valued optimization

Ling Jiang, Jinde Cao and Lianglin Xiong

Applied Mathematics and Computation, 2019, vol. 361, issue C, 599-608

Abstract: In this paper, we provide the augmented weighted Tschebyscheff scalarization to computing robust efficient solutions for uncertain multiobjective optimization problems (UMOPs). Furthermore, we propose two generalized robustness concepts called the minmax certainly nondominated ordered robustness and the certainly less ordered robustness to general spaces and cones in the context of set orderings. Some explanations for both concepts are given, as well as the relations between them and several existing robustness are clearly described. Finally, the corresponding relationships to set-valued optimization are well revealed.

Keywords: Robustness; Uncertain multiobjective optimization; Set-valued optimization; Set ordering relations (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304710
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:361:y:2019:i:c:p:599-608

DOI: 10.1016/j.amc.2019.06.006

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().