Abstract
In this note a sufficient optimality condition is established for nonlinear programming problems over arbitrary cone domains. A Kuhn-Tucker type sufficient condition is established if the programming problem has a pseudoconvex objective function and a convex feasible region.
Publisher
Cambridge University Press (CUP)