Summary: Sufficient conditions for optimality of Kuhn-Tucker type of nonlinear nondifferentiable programming problems are given under invexity assumptions. Based upon these conditions duality theorems are established.