On various duality theorems in nonlinear programming

From MaRDI portal





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.











This page was built for publication: On various duality theorems in nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078078)