Abstract
A new approach to a solution of a nonlinear constrained mathematical programming problem and its Mond–Weir duals is introduced. An η-approximated problem associated with a primal nonlinear programming problem is presented that involves η-approximated functions constituting the primal problem. The equivalence between the original mathematical programming problem and its associated η-approximated optimization problem is established under invexity assumption. Furthermore, η-approximated dual problems in the sense of Mond–Weir are introduced for the obtained η-approximated optimization problem in this method. By the help of η-approximated dual problems some duality results are established for the original mathematical programming problem and its original duals.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
