Abstract
A pair of Mond–Weir type nondifferentiable second-order symmetric primal and dual problems in mathematical programming is formulated. Weak duality, strong duality, and converse duality theorems are established under η-pseudobonvexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. Moreover, the self duality theorem is also discussed.
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.
