Optimality and Duality in Parametric Convex Lexicographic Programming

1998 ◽  
pp. 359-379 ◽  
Author(s):  
C. A. Floudas ◽  
S. Zlobec
Keyword(s):  
Optimality And Duality

Optimality and duality for vector optimization problem with non-convex feasible set

OPSEARCH ◽  
2019 ◽  
Vol 57 (1) ◽  
pp. 1-12 ◽  
Author(s):  
S. K. Suneja ◽  
Sunila Sharma ◽  
Priyanka Yadav
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Feasible Set ◽  
Optimality And Duality

scholarly journals Optimality and Duality for Complex Nondifferentiable Fractional Programming

1997 ◽  
Vol 210 (2) ◽  
pp. 804-824 ◽  
Author(s):  
Jen-Chwan Liu ◽  
Chin-Cheng Lin ◽  
Ruey-Lin Sheu
Keyword(s):  
Fractional Programming ◽  
Optimality And Duality

scholarly journals Optimality and Duality on Riemannian Manifolds

2018 ◽  
Vol 22 (5) ◽  
pp. 1245-1259 ◽  
Author(s):  
Gabriel Ruiz-Garzón ◽  
Rafaela Osuna-Gómez ◽  
Antonio Rufián-Lizana ◽  
Beatriz Hernández-Jiménez
Keyword(s):  
Riemannian Manifolds ◽  
Optimality And Duality

scholarly journals Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions

2020 ◽  
Vol 11 ◽  
pp. 17
Author(s):  
Tarek Emam
Keyword(s):  
Strong Duality ◽  
Sufficient Optimality Conditions ◽  
Convex Programming Problem ◽  
Duality Theorems ◽  
Support Functions ◽  
Primal Problem ◽  
Multi Objective ◽  
Multi Objective Programming ◽  
Optimality And Duality ◽  
Convexity Assumptions

In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak and strong duality theorems under various generalized E-convexity assumptions.

Sign in / Sign up

Export Citation Format

Share Document