On converse duality in complex nonlinear programming
J. Parida · Bulletin of the Australian Mathematical Society · 1975
In this note a converse duality theorem is proved for a class of nonlinear programming problems over polyhedral cones in finite dimensional complex space by a direct use of a Kuhn-Tucker type necessary and sufficient condition for constrained optimization in complex space.