The linear-quadratic bilevel programming problem

• Tipo: Artigo em Revista Científica Internacional
• Data: 1994

Autores

J. Júdice (Autor) Outra; Ana Maria Faustino (Autor) FEUP

Revista

Título: INFOR: Information Systems and Operational Research

Vol. 32 Nº 2 - May

Páginas: 87-96

ISSN: 0315-5986

Editora: Taylor & Francis

Classificação Científica

FOS: Ciências exactas e naturais > Matemática

Outras Informações

Resumo (PT): Recently we have developed a Sequential LCP (SLCP) algorithm for the solution of the Linear Bilevel Programming Problem (LE3LP). The SLCP algorithm consists of solving a sequence of Linear Complementarity Problems (LCP) by a hybrid enumerative method. In this paper we show that the SLCP algorithm can successfully solve the Linear-Quadratic Bilevel Programming Problem (LQBLP), if some modifications are introduced in the hybrid enumerative method. The LQBLP was introduced by Bard and Moore, who proposed a Branch-and-Bound method for its solution. Computational experience with the SLCP and Branch-and-Bound methods for small and medium scale LQBLPs shows that the SLCP algorithm is consistently more efficient and the gap increases with the dimension of the LOBLP. As for the LBLP, the SLCP algorithm is shown to be quite effi-cient at finding a global minimum for the LQBLP, but it is harder to establish that such solution bas been found.

Abstract (EN): Recently we have developed a Sequential LCP (SLCP) algorithm for the solution of the Linear Bilevel Programming Problem (LE3LP). The SLCP algorithm consists of solving a sequence of Linear Complementarity Problems (LCP) by a hybrid enumerative method. In this paper we show that the SLCP algorithm can successfully solve the Linear-Quadratic Bilevel Programming Problem (LQBLP), if some modifications are introduced in the hybrid enumerative method. The LQBLP was introduced by Bard and Moore, who proposed a Branch-and-Bound method for its solution. Computational experience with the SLCP and Branch-and-Bound methods for small and medium scale LQBLPs shows that the SLCP algorithm is consistently more efficient and the gap increases with the dimension of the LOBLP. As for the LBLP, the SLCP algorithm is shown to be quite effi-cient at finding a global minimum for the LQBLP, but it is harder to establish that such solution bas been found.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 10