Abstract
The mathematical program with switching constraints (MPSC), which has been introduced recently, is a difficult class of optimization problems. The reason for the difficulty is that the existence of the switching constraint makes the standard constraint qualifications invalid at local minimizers. This paper proposes the Wolfe-type dual (WD) model of this problem without switching constraints. Under the assumptions of convexity and strict convexity, we derive the weak, strong, converse, restricted converse, and strict converse duality results between MPSC and WD.
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.
