A modified simplex approach for solving bilevel linear programming problems

European Journal of Operational Research

Volumn 67, Issue 1, 1993, Pages 126-135

  Önal, Hayri ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Beale's algorithm; Bilevel linear programming; Kuhn Tucker conditions; Quadratic programming; Simplex algorithm

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; DECISION THEORY; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; MATHEMATICAL MODELS;

BEALE'S ALGORITHM; BILEVEL LINEAR PROGRAMMING; KUHN TUCKER CONDITIONS; MODIFIED SIMPLEX APPROACH; QUADRATIC PROGRAMMING; SIMPLEX ALGORITHM;

LINEAR PROGRAMMING;

EID: 0027595159     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(93)90327-J     Document Type: Article

References (14)

1. An investigation of the linear three-level programming problem
2. An explicit solution to the multi-level programming problem
3. A branch and bound algorithm for the bilevel programming problem
4. On quadratic programming
5. Two-level linear programming
6. Mathematical programs with optimization problems in the constraints
7. A linear two-level programming problem
8. A representation and economic interpretation of a two-level programming problem
9. A sequential LCP method for bilevel linear programming
10. Two level planning
11. A linear bilevel programming algorithm based on bicriteria programming
12. The hybrid algorithm for solving the three level linear programming problems