Generalization of some duality theorems in nonlinear programming

Pseudoconvexity of a function on one set with respect to some other set is defined and duality theorems are proved for nonlinear programming problems by assuming a certain kind of convexity property for a particular linear combination of functions involved in the problem rather than assuming the convexity property for the individual functions as is usually done. This approach generalizes some of the well-known duality theorems and gives some additional strict converse duality theorems which are not comparable with the earlier duality results of this type. Further it is shown that the duality theory for nonlinear fractional programming problems follows as a particular case of the results established here.