Anzeige
Erschienen in:
1998 | OriginalPaper | Buchkapitel
A New Branch and Bound Method for Bilevel Linear Programs
verfasst von : Hoang Tuy, Saied Ghannadan
Erschienen in: Multilevel Optimization: Algorithms and Applications
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A new branch and bound method is proposed for the Bilevel Linear Programming based on a transformation of the problem into a linear program with an additional reverse convex constraint. The method exploits the separated non-convexity and a monotonic property of the reverse convex constraint. Computational experiments are reported which show the efficiency of the approach for problems in which the matrix A2 is substantially smaller than the total number of variables.