Theoretical and computational results for a linear bilevel problem

MaRDI QIDQ2768048zbMATH OpenFDO

Authors Manoel Campêlo, Susana Scheimberg

Publication date 10 October 2002

zbMATH Keywords

global optimizationbilevel linear programmingexact penalty methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A study of local solutions in linear bilevel programming
• A computational study of global algorithms for linear bilevel programming
• Linear bilevel problems: genericity results and an efficient method for computing local minima
• A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
• scientific article; zbMATH DE number 817607

Cited in

(5)

• A study of local solutions in linear bilevel programming
• A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
• Exact penalty method for the nonlinear bilevel programming problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Computing upper bounds for a LBPP with and without probabilistic constraints

This page was built for publication: Theoretical and computational results for a linear bilevel problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768048)