Multiobjective programming under d-invexity

European Journal of Operational Research

Volumn 137, Issue 1, 2002, Pages 28-36

  Antczak, Tadeusz ^a  

^a UNIVERSITY OF LODZ   (Poland)

Author keywords

(Weak) Pareto optimal solution; d Invex function with respect to ; Duality; Multiobjective programming; Optimality conditions

Indexed keywords

CONSTRAINT THEORY; DIFFERENTIAL EQUATIONS; NONLINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MULTIOBJECTIVE PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0037116764     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00092-3     Document Type: Article

References (16)

1. What is invexity?
2. Invex functions and constrained local minima
3. Nondifferentiable optimization by smooth approximations
4. Multi-objective duality with invexity
5. On sufficiency of the Kuhn-Tucker conditions
6. Necessary and sufficient conditions in constrained optimization
7. On generalized convex mathematical programming
8. Optimality criteria in nonlinear programming involving nonconvex functions
9. Generalized concavity and duality
10. Nonsmooth invexity
11. Optimality criteria in mathematical programming involving generalized invexity
12. Pre-invex functions in multiple objective optimization
13. A duality theorem for nonlinear programming
14. d-invexity and optimality conditions