On converse duality for a nondifferentiable program

DOI10.1017/S0004972700005049MaRDI QIDQ3911677zbMATH OpenFDO

Authors T. R. Gulati

Publication date 1982

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

Full work available at URL https://doi.org/10.1017/S0004972700005049

zbMATH Keywords

Abadie's constraint qualificationconverse dualityFritz John conditionsgeneralized Slater constraintlinear constraintsnonlinear nondifferentiable program

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• A class of nondifferentiable mathematical programming problems
• A Duality Theorem for Nonlinear Programming
• A Note on Duality Theorem for a Nonlinear Programming Problem
• Duality in Homogeneous Programming
• On a constraint qualification in a nondifferentiable programming problem
• Properties of a multifacility location problem involving euclidian distances
• Supports of a convex function
• Technical Note—On Converse Duality in Nonlinear Programming

Cited in

(2)

• Optimality conditions for a class of nondifferentiable minmax programming problems
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems

This page was built for publication: On converse duality for a nondifferentiable program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911677)