On Converse Duality for Nonsmooth Optimization Problem

DOI10.1080/02522667.1993.10699145zbMath0781.90082OpenAlexW2345651439MaRDI QIDQ5286923

Gue Myung Lee, Do Sang Kim

Publication date: 25 August 1993

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1993.10699145

zbMATH Keywords

weak dualitygeneralized Kuhn-Tucker sufficient optimality criterianonsmooth invexity of Lipschitz functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (1)

Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• On generalized pseudoconvex functions
• Generalised convexity and symmetric duality in nonlinear programming
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• Nonsmooth invexity
• Optimization and nonsmooth analysis

This page was built for publication: On Converse Duality for Nonsmooth Optimization Problem