Set-valued minimax programming problems under generalized cone convexity

K Das,C Nahak

doi:10.1007/s12215-016-0258-6

Set-valued minimax programming problems under generalized cone convexity

K Das, C Nahak

https://doi.org/10.1007/s12215-016-0258-6

Copy DOI

Journal: Rendiconti del Circolo Matematico di Palermo (1952 -)	Publication Date: Sep 6, 2016
Citations: 6

Affiliation: Indian Institute of Technology Kharagpur

#Minimax Programming Problem #Mixed + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

In this paper, a set-valued minimax programming problem (MP) is considered. The Karush–Kuhn–Tucker (KKT) sufficient optimality conditions are established for the problem (MP) via contingent epiderivative under generalized cone convexity assumptions. Mond–Weir (MWD), Wolfe (WD) and mixed (MD) types duality are constructed for the problem (MP) and desired duality theorems between them are established.

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 call

Similar Papers

Paper Title

Journal

Date

Author

More From: Rendiconti del Circolo Matematico di Palermo (1952 -)

Paper Title

Journal

Date

Author

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.