Abstract

The mathematical program with switching constraint (MPSC) problem makes a new-type optimization issue in recent years. Due to the existence of switching constraints, the common constraint specification is not satisfied, so that the convergence results of existing algorithms can not be directly applied to this problem. The sequential quadratic programming (SQP) method was applied to solve the problem, and to prove that the clustering point of the solution sequence of the subproblem is the Karush-Kuhn-Tucker point of the original problem under the linear independent constraint specification with the switching constraint. At the same time, in order to improve the relationship between stationary points, the equivalence between the strong stationary point and the KKT point was proved. Finally, the numerical results show that, the sequential quadratic programming method is feasible to deal with this type of problems.

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

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.