Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

Joint Authors

Yu, GuoLin
Gong, Tiantian
Yu, Guolin

Source

Complexity

Issue

Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-8, 8 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2020-07-25

Country of Publication

Egypt

No. of Pages

8

Main Subjects

Philosophy

Abstract EN

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.

American Psychological Association (APA)

Yu, GuoLin& Yu, Guolin& Gong, Tiantian. 2020. Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem. Complexity،Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1145858

Modern Language Association (MLA)

Yu, GuoLin…[et al.]. Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem. Complexity No. 2020 (2020), pp.1-8.
https://search.emarefa.net/detail/BIM-1145858

American Medical Association (AMA)

Yu, GuoLin& Yu, Guolin& Gong, Tiantian. Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem. Complexity. 2020. Vol. 2020, no. 2020, pp.1-8.
https://search.emarefa.net/detail/BIM-1145858

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-1145858