A computational study of global algorithms for linear bilevel programming
From MaRDI portal
Publication:596661
DOI10.1023/B:NUMA.0000021760.62160.a4zbMath1054.65060MaRDI QIDQ596661
Susana Scheimberg, Carlos Henrique Medeiros de Sabóia, Manoel B. Campêlo
Publication date: 10 August 2004
Published in: Numerical Algorithms (Search for Journal in Brave)
algorithmglobal optimizationnumerical examplesbranch-and-boundexact penalty methodsbilevel linear programming
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Linear programming (90C05)
Related Items (7)
A review of recent advances in global optimization ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ A differential evolution with two mutation strategies and a selection based on an improved constraint-handling technique for bilevel programming problems ⋮ On a Solving Bilevel D.C.-Convex Optimization Problems ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
This page was built for publication: A computational study of global algorithms for linear bilevel programming
