Abstract
Several Mond-Weir type duals are proposed for a certain minmax programming problem and the notion of proper (b, η)-invexity is used to establish duality theorems relating the primal and the duals. The duals for a minmax (generalized) fractional programming problem are presented as special cases of the main problem considered 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 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.
