Fritz john second-order duality for nonlinear programming

AbstractA second-order dual to a nonlinear programming problem is formulated. This dual uses the Fritz John necessary optimality conditions instead of the Karush-Kuhn-Tucker necessary optimality conditions, and thus, does not require a constraint qualification. Weak, strong, strict-converse, and converse duality theorems between primal and dual problems are established