On Sufficiency and Duality for Generalized Quasiconvex Programs

For a nonlinear programming problem, under differentiability assumptions, Fritz John suffcient optimality conditions are stated. Also some duality theorems are proved for Mond-Weir type duals. All results are given under generalized convexity assumptions.