Abstract
We first propose an exact penalty method to solve strong-weak linearbilevel programming problem (for short, SWLBP) for every fixedcooperation degree from the follower. Then, we prove that the solution ofpenalized problem is also that of the original problem under someconditions. Furthermore, we give some properties of the optimalvalue function (as a function of the follower's cooperation degree)of SWLBP. Finally, we develop a method to acquire the criticalpoints of the optimal value function without enumerating all valuesof the cooperation degree from the follower, and thus this functionis also achieved. Numerical results show that the proposedmethods are feasible.
Sign-in/Register to access full text options 
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 callMore From: Journal of Industrial & Management Optimization
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.
