Major-efficient solutions and weakly major-efficient solutions of multiobjective programming

1994 ◽  
Vol 9 (1) ◽  
pp. 85-94
Author(s):  
Hu Yuda
Keyword(s):  
Multiobjective Programming ◽  
Efficient Solutions

Generating ε-efficient solutions in multiobjective programming

2007 ◽  
Vol 177 (3) ◽  
pp. 1566-1579 ◽  
Author(s):  
Alexander Engau ◽  
Margaret M. Wiecek
Keyword(s):  
Multiobjective Programming ◽  
Efficient Solutions

scholarly journals Multiobjective duality with ρ−(η,θ)-invexity

2005 ◽  
Vol 2005 (2) ◽  
pp. 175-180 ◽  
Author(s):  
C. Nahak ◽  
S. Nanda
Keyword(s):  
Programming Problem ◽  
Multiobjective Programming ◽  
Efficient Solutions ◽  
Duality Theorems ◽  
Converse Duality ◽  
Dual Problems ◽  
Properly Efficient Solutions ◽  
Multiobjective Programming Problem ◽  
Primal And Dual Problems ◽  
Primal And Dual

Under ρ−(η,θ)-invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem.

scholarly journals Optimality Conditions for a Nonsmooth Uncertain Multiobjective Programming Problem

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Wenyan Han ◽  
Guolin Yu ◽  
Tiantian Gong
Keyword(s):  
Optimality Conditions ◽  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Efficient Solutions ◽  
Type I ◽  
Generalized Convex Functions ◽  
Alternative Theorem ◽  
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 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.

Relations among efficient solutions in uncertain multiobjective programming

2016 ◽  
Vol 16 (3) ◽  
pp. 329-357 ◽  
Author(s):  
Mingfa Zheng ◽  
Yuan Yi ◽  
Zutong Wang ◽  
Tianjun Liao
Keyword(s):  
Multiobjective Programming ◽  
Efficient Solutions
Sign in / Sign up

Export Citation Format

Share Document