An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Function.

A new approach to a solution of a nonlinear constrained mathematical programming problem and its Mond-Weir duals is introduced. An n-approximated problem associated with a primal nonlinear programming problem is presented that involves n-approximated functions constituting the primal problem. The equivalence between the original mathematical programming problem and its associated n-approximated optimization problem is established under invexity assumption. Furthermore, n-approximated dual problems in the sense of Mond-Weir are introduced for the obtained n-approximated optimization problem in this method. By the help of n-approximated dual problems some duality results are established for the original mathematical programming problem and its original duals. [ABSTRACT FROM AUTHOR]