Duality for a class of nondifferentiable multiobjective programming problems

DOI10.1006/jmaa.2000.6991zbMath0970.90097MaRDI QIDQ1840559

Yang, Xinmin, Xiao Qi Yang, Kok Lay Teo

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

zbMATH Keywords

support function; weak duality theorems; nondifferentiable multiobjective programs; weak convexity conditions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

\(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions, 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, Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming, 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

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• On efficiency and duality for multiobjective programs
• Duality for some nondifferentiable static multiobjective programming problems
• Non differentiable symmetric duality