Duality for a non-differentiable programming problem

DOI10.1017/S0004972700030513zbMath0881.90111MaRDI QIDQ4346938

J. Zhang, Bertram Mond

Publication date: 19 February 1998

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

dualitynon-differentiable programminginvexity conditionsgeneralised dual

Mathematics Subject Classification ID

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

Related Items (9)

Unnamed Item ⋮ Mixed type duality for a programming problem containing support function. ⋮ Second order duality for nondifferentiable minimax programming problems with generalized convexity ⋮ Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints ⋮ Duality for a class of multiobjective control problems with generalized invexity ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ On nonsmooth multiobjective programming with generalized univexity ⋮ Second-Order Duality for Nondifferentiable Multiobjective Programming Problems ⋮ Higher-Order Duality in Nondifferentiable Multiobjective Programming

Cites Work

• Duality with invexity for a class of nondifferentiable static and continuous programming problems
• On sufficiency of the Kuhn-Tucker conditions
• Second- and higher-order duality in nonlinear programming
• A class of nondifferentiable mathematical programming problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• An optimality condition for a nondifferentiable convex program
• Generalized concavity and duality with a square root term
• What is invexity?
• Supports of a convex function
• On a constraint qualification in a nondifferentiable programming problem

This page was built for publication: Duality for a non-differentiable programming problem