Technical Note—On Converse Duality for a Nondifferentiable Programming Problem

Abstract

Some authors have assumed that the Kuhn-Tucker constraint qualification is always satisfied in a mathematical programming problem in which the nonlinear constraints define a convex set with nonempty interior. That this assumption is incorrect is shown by counterexample.