Higher Order Convexity and Duality in Multiobjective Programming Problems

DOI10.1007/978-1-4613-3285-5_6zbMath0956.90042OpenAlexW44943379MaRDI QIDQ4946117

J. Zhang

Publication date: 7 June 2000

Published in: Applied Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4613-3285-5_6

zbMATH Keywords

generalized convexitydualitymultiobjective programming problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (9)

Higher-order \((\Phi,\rho)\)-\(V\)-invexity and duality for vector optimization 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 ⋮ Nondifferentiable higher order duality in multiobjective programming involving cones ⋮ Wolfe type higher order multiple objective nondifferentiable symmetric dual programming with generalized invex function ⋮ Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity ⋮ Higher-order duality for multiobjective programming problems involving \({(F, \alpha, \rho, d)}\)-V-type I functions ⋮ Higher-order symmetric duality in vector optimization problem involving generalized cone-invex functions ⋮ Higher order duality in multiobjective fractional programming problem with generalized convexity

This page was built for publication: Higher Order Convexity and Duality in Multiobjective Programming Problems