Sufficient optimality conditions and duality in multiobjective optimization involving generalized convexity

Numerical Functional Analysis and Optimization

Volumn 22, Issue 7-8, 2001, Pages 775-788

  Aghezzaf, B ^a   Hachimi, M ^a  

^a FACULTÉ DES SCIENCES AIN CHOCK   (Morocco)

Author keywords

Converse duality; Convexity; Duality; Invexity; Multiobjective programming; Pareto minimal solutions; Sufficient conditions

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

MULTIOBJECTIVE PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 0035519724     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1081/NFA-100108308     Document Type: Article

References (17)

1. Sufficient conditions in multiobjective optimization problems
2. Second order optimality conditions in multiobjective optimization problems
3. Sufficiency and duality in multiobjective programming involving generalized (F, ρ)-convexity
4. Constrained minimization under vector-valued criteria in finite dimensional spaces
5. Efficiency and generalized convex duality for multiobjective programs
6. On sufficiency of the Kuhn-Tucker conditions
7. Necessary and sufficiency conditions in constrained optimization
8. Convex transformable programming problems and invexity
9. Optimality criteria and duality in multiple-objective optimization involving generalized invexity
10. On Fritz John type optimality criterion in multiobjective optimization
11. Optimality conditions in multiobjective differentiable programming
12. Generalization of preinvex and B-vex functions
13. A converse duality theorem in multiple objective programming
14. Preinvex functions in multiple objective optimization
15. D-invexity and optimality conditions