–convex transformability in nonlinear programming problems
We show that for -convex transformable nonlinear programming problems the Karush-Kuhn-Tucker necessary optimality conditions are also sufficient and we provide a method of solving such problems with the aid of associated -convex ones.