On various duality theorems in nonlinear programming

Recently, Gulati and Craven and Mond and Egudo established strict converse duality theorems for some of Mond-Weir duals for nonlinear programming problems. Here, we establish various duality theorems under weaker convexity conditions that are different from those of Gulati and Craven, Mond and Weir, and Mond and Egudo.The first author is thankful to the Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319.