scholarly journals Generating Efficient Solutions in Bilevel Multi-Objective Programming Problems

2013 ◽  
Vol 03 (02) ◽  
pp. 289-298 ◽  
Author(s):  
Calice Olivier Pieume ◽  
Patrice Marcotte ◽  
Laure Pauline Fotso ◽  
Patrick Siarry
Keyword(s):  
Efficient Solutions ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Objective Programming

scholarly journals Optimality for E-[0,1] convex multi-objective programming

Filomat ◽  
2017 ◽  
Vol 31 (3) ◽  
pp. 529-541 ◽  
Author(s):  
Tarek Emama
Keyword(s):  
Feasible Solution ◽  
Necessary Conditions ◽  
Optimal Solution ◽  
Efficient Solutions ◽  
Properly Efficient Solution ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Sufficient And Necessary Conditions ◽  
Objective Programming

In this paper, we interest with deriving the sufficient and necessary conditions for optimal solution of special classes of Programming. These classes involve generalized E-[0,1] convex functions. Characterization of efficient solutions for E-[0,1] convex multi-objective Programming are obtained. Finally, sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are derived.

scholarly journals Optimality and duality for complex multi-objective programming

2022 ◽  
Vol 12 (1) ◽  
pp. 121
Author(s):  
Tone-Yau Huang ◽  
Tamaki Tanaka
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Efficient Solutions ◽  
Dual Model ◽  
Duality Theorems ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Optimality And Duality ◽  
Objective Programming

<p style='text-indent:20px;'>We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of problem (CMP), we introduce several properties of optimal efficient solutions and scalarization techniques. Furthermore, a certain parametric dual model is discussed, and their duality theorems are proved.</p>

Sign in / Sign up

Export Citation Format

Share Document