On Strong Pseudoinvexity in a Programming Problem Containing Lp Norm in the Objective Function

Sufficient conditions for optimality of Kuhn-Tucker type of a programming problem containing Lp norm in the objective function are obtained under strong pseudoinvexity assumptions. Based upon these conditions duality theorems are also established.