Abstract
An alternative definition of the linear bilevel programming problem BLP has recently been proposed by Lu, Shi, and Zhang. This note shows that the proposed definition is a restriction of BLP. Indeed, the new definition is equivalent to transferring the first-level constraints involving second-level variables into the second level, resulting in a special case of BLP in which there are no first-level constraint involving second-level variables. Thus, contrary to what is stated by the authors who suggested the new definition, this does not allow to solve a wider class of problems, but rather relaxes the feasible region, allowing for infeasible points to be considered as 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 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.
