A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming

DOI10.1007/s11590-010-0247-1zbMath1258.90069OpenAlexW2107909181MaRDI QIDQ691405

Kok Lay Teo, Yang, Xinmin

Publication date: 30 November 2012

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

Full work available at URL: https://doi.org/10.1007/s11590-010-0247-1

zbMATH Keywords

converse dualityhigher-order dual modelsnondifferentiable mathematical programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Higher-order symmetric duality for multiobjective programming with cone constraints

Cites Work

• Unnamed Item
• Second- and higher-order duality in nonlinear programming
• A class of nondifferentiable mathematical programming problems
• Higher-order symmetric duality in nondifferentiable multiobjective programming problems.
• Higher-order generalized invexity and duality in nondifferentiable mathematical programming
• Non-differentiable second order symmetric duality in mathematical programming with \(F\)-convexity
• Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
• Second order symmetric duality in non-differentiable multiobjective programming with \(F\)-convexity
• Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Generalized concavity and duality with a square root term
• On second-order symmetric duality in nondifferentiable programming

This page was built for publication: A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming