Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a nonsmooth uncertain multiobjective programming problem (NUMP). Firstly, under the extended nonsmooth Mangasarian–Fromovitz constrained qualification assumption, the optimalit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Complexity (New York, N.Y.) Jg. 2020; H. 2020; S. 1 - 8
Hauptverfasser: Yu, GuoLin, Gong, Tiantian, Yu, Guolin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 25.07.2020
Hindawi
John Wiley & Sons, Inc
Wiley
Schlagworte:
Convexity
Mathematical programming
Optimization
Robustness
ISSN:1076-2787, 1099-0526
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This note is devoted to the investigation of optimality conditions for robust approximate quasi weak efficient solutions to a nonsmooth uncertain multiobjective programming problem (NUMP). Firstly, under the extended nonsmooth Mangasarian–Fromovitz constrained qualification assumption, the optimality necessary conditions of robust approximate quasi weak efficient solutions are given by using an alternative theorem. Secondly, a class of generalized convex functions is introduced to the problem (NUMP), which is called the pseudoquasi-type-I function, and its existence is illustrated by a concrete example. Finally, under the pseudopseudo-type-I generalized convexity hypothesis, the optimality sufficient conditions for robust approximate quasi weak efficient solutions to the problem (NUMP) are established.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1076-2787
1099-0526
DOI:10.1155/2020/9849636