Duality for a class of nondifferentiable multiobjective programming problems
From MaRDI portal
Publication:1840559
DOI10.1006/jmaa.2000.6991zbMath0970.90097OpenAlexW2055394249MaRDI QIDQ1840559
Xiao Qi Yang, Kok Lay Teo, Yang, Xinmin
Publication date: 23 October 2001
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2000.6991
support functionweak duality theoremsnondifferentiable multiobjective programsweak convexity conditions
Related Items (12)
Duality problems with second-order polyhedral discrete and differential inclusions ⋮ Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming ⋮ Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems ⋮ Higher-order duality for a class of nondifferentiable multiobjective programming problems involving generalized type I and related functions ⋮ Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems ⋮ Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity ⋮ Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions ⋮ Efficiency and generalized convex duality for nondifferentiable multiobjective programs ⋮ \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions ⋮ Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming ⋮ Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity ⋮ Higher order duality in multiobjective fractional programming problem with generalized convexity
Cites Work
This page was built for publication: Duality for a class of nondifferentiable multiobjective programming problems
