A sequential LCP method for bilevel linear programming

Publisher Website

1 December 1992

journal article
research article
Published by Springer Nature in Annals of Operations Research

Vol. 34 (1) , 89-106
https://doi.org/10.1007/bf02098174

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

A Branch and Bound Algorithm for the Bilevel Programming Problem
SIAM Journal on Scientific and Statistical Computing, 1990
An experimental investigation of enumerative methods for the linear complementarity problem
Computers & Operations Research, 1988
An implicit enumeration procedure for the general linear complementarity problem
Published by Springer Nature ,1987
Network design problem with congestion effects: A case of bilevel programming
Mathematical Programming, 1986
Two-Level Linear Programming
Management Science, 1984
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
Mathematical Programming, 1982
New Finite Pivoting Rules for the Simplex Method
Mathematics of Operations Research, 1977