Higher-order symmetric duality in multiobjective programming with invexity

DOI10.3934/JIMO.2008.4.271zbMath1161.90485OpenAlexW2324573428MaRDI QIDQ1008809

Yang, Xinmin, Xiao Qi Yang, Kok Lay Teo

Publication date: 30 March 2009

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2008.4.271

zbMATH Keywords

invexityduality theoremsnonlinear multiobjective programminghigher order symmetric dual models

Mathematics Subject Classification ID

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

Related Items (8)

Higher-order symmetric duality in multiobjective programming problems ⋮ Higher Order Hybrid Invexity Frameworks and Discrete Multiobjective Fractional Programming Problems ⋮ Hybrid (Φ,Ψ, ρ, ζ, θ)−invexity frameworks and efficiency conditions for multiobjective fractional programming problems ⋮ Higher-order symmetric duality for multiobjective programming with cone constraints ⋮ Higher-order Mond-Weir converse duality in multiobjective programming involving cones ⋮ Higher-order symmetric duality in multiobjective programming problems under higher-order invexity ⋮ Higher-order generalized invexity in variational problems ⋮ Higher-order symmetric duality with higher-order generalized invexity

This page was built for publication: Higher-order symmetric duality in multiobjective programming with invexity