Liu Xiaomi, Shouyan Wang
Abstract
Linear bilevel programming deals with optimization problems in which the constraint region is implicitly determined by another optimization problem. This paper presents a new algorithm for solving linear bilevel programs. A numerical example is given to illustrate this method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Linear bilevel programming deals with optimization problems in which the constraint region is implicitly determined by another optimization problem. This paper presents a new algorithm for solving linear bilevel programs. A numerical example is given to illustrate this method.
Key concepts: Bilevel optimization, Mathematical optimization, Linear programming, Constraint (computer-aided design), Computer science, Criss-cross algorithm, Algorithm, Mathematics