Abstract
This paper presents an approach for solving bilevel linear programming problems (BLPP). It is based on the result that an optimal solution to the BLPP is reachable at an extreme point of the underlying region. Consequently, we develop a pivot technique to find the global optimal solution on an expanded tableau that represents the data of the BLPP. The pivot technique allows to rank in increasing order the outer level objective function value until
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.
