Note on a modified simplex approach for solving bilevel linear programming problems

European Journal of Operational Research

Volumn 126, Issue 2, 2000, Pages 454-458

  Campêlo, Manoel ^a   Scheimberg, Susana ^b  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING; THEOREM PROVING;

BILEVEL LINEAR PROGRAMMING; GLOBAL OPTIMA; SIMPLEX METHODS;

LINEAR PROGRAMMING;

EID: 17544394154     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00297-0     Document Type: Article

References (4)

1. E.M.L. Beale, On quadratic programming, Naval Research Logistics Quarterly 6 (1959) 227-243.
2. M. Campêlo, S. Scheimberg, An analysis of the bilevel linear problem by a penalty approach, Technical Report ES-479/98, Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, 1998.
3. M. Campêlo, S. Scheimberg, A note on a modified simplex approach for solving bilevel linear programming problems, Technical Report ES-480/98, Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro, 1998.
4. H. Önal, A modified simplex approach for solving bilevel linear programming problems, European Journal of Operational Research 67 (1993) 126-135.