A note on strong duality theorem for a multiobjective higher order nondifferentiable symmetric dual programs

DOI10.1007/s12597-015-0221-xzbMath1360.90286OpenAlexW2183886429MaRDI QIDQ522363

Indira P. Debnath, Shiv K. Gupta, Izhar Ahmad

Publication date: 28 April 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-015-0221-x

zbMATH Keywords

multiobjective programmingsymmetric dualitystrong dualitysupport functionproperly efficient solution

Mathematics Subject Classification ID

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

Related Items (1)

Higher-order symmetric duality for multiobjective programming with cone constraints

Cites Work

• Strong duality theorem for multiobjective higher-order nondifferentiable symmetric dual programs
• A note on higher-order nondifferentiable symmetric duality in multiobjective programming
• More on subgradient duality
• Higher-order symmetric duality in nondifferentiable multiobjective programming problems.

This page was built for publication: A note on strong duality theorem for a multiobjective higher order nondifferentiable symmetric dual programs