Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
type: Item
instance of: scholarly article
title: Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity
zbMATH Open document ID: 1180.90300
author: Hachem Slimani
author: Mohammed Said Radjef
published in: European Journal of Operational Research
publication date: 2009-11-17T00:00:00Z
review text: The point of this paper is, that a generalized invexity for vector functions is introduced, where each component of such a vector function is directionally differentiable in its own direction instead of a same direction \(d\). Using this kind of invexity the authors get new classes of multiobjective programming problems slightly different from such vector problems in this area. They prove corresponding necessary and sufficient optimality conditions and -- for Mond-Weir type duality -- duality results.
reviewed by: Alfred Göpfert
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5634735
zbMATH Keywords: multiobjective programming
zbMATH Keywords: generalized invexity
zbMATH Keywords: optimality
zbMATH Keywords: duality
zbMATH Keywords: semi-directionally differentiable functions
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.04.018
OpenAlex ID: W2000550454
cites work: Generalized invexity and duality in multiobjective programming problems
cites work: A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
cites work: Mean value in invexity analysis
cites work: Multiobjective programming under \(d\)-invexity
cites work: Nonlinear Programming
cites work: Generalized B-vex functions and generalized B-vex programming
cites work: What is invexity?
cites work: Q4000274
cites work: Nondifferentiable optimization by smooth approximations
cites work: Q3680623
cites work: Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions
cites work: Proper efficiency and the theory of vector maximization
cites work: Various types of nonsmooth invex functions
cites work: \(\varepsilon\)-optimality for multiobjective programming on a Banach space
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Necessary and sufficient conditions in constrained optimization
cites work: Multiobjective programming under generalized type I invexity
cites work: On generalised convex mathematical programming
cites work: Optimality criteria and duality in multiple-objective optimization involving generalized invexity
cites work: Q5589748
cites work: The essence of invexity
cites work: Some nondifferentiable multiobjective programming problems
cites work: Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
cites work: Nondifferentiable multiobjective programming under generalized \(d\)-univexity
cites work: Q3325486
cites work: A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
cites work: Nonsmooth invexity
cites work: Optimality criteria in mathematical programming involving generalized invexity
cites work: Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions
cites work: Generalized nonsmooth invexity over cones in vector optimization
cites work: Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
cites work: Pre-invex functions in multiple objective optimization
cites work: \(D\)-invexity and optimality conditions
DOI: 10.1016/J.EJOR.2009.04.018
description: scientific article; zbMATH DE number 5634735