Abstract
Mond-Weir and Wolfe type non-differentiable primal and dual symmetric problems in mathematical programming are formulated. In this paper, we use a generalisation of convexity, namely G-invexity, to prove weak, strong and converse duality relations for the two non-differentiable symmetric programming problems. Some previous known results for symmetric programming problems turn out to be special cases of the results established in the paper.
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 callMore From: International Journal of Mathematics in Operational Research
Disclaimer: 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.
