scientific article; zbMATH DE number 1163112

MaRDI QIDQ4394601zbMATH OpenFDO

Authors Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard

Publication date 11 June 1998

zbMATH Keywords

bilevel programmingbranch-and-boundconcave optimizationlinear mixed 0-1 programmingmaxmin problemNash equilibria

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• Links between linear bilevel and mixed 0-1 programming problems
• The Mixed Integer Linear Bilevel Programming Problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A symmetrical linear maxmin approach to disjoint bilinear programming
• scientific article; zbMATH DE number 35514

Cited in

(13)

• Links between linear bilevel and mixed 0-1 programming problems
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Technical Note—On Min-Max Integer Allocation Problems
• scientific article; zbMATH DE number 3869007 (Why is no real title available?)
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Solving Max-min Relational Equations. Software and Applications
• scientific article; zbMATH DE number 3970510 (Why is no real title available?)
• scientific article; zbMATH DE number 3988071 (Why is no real title available?)
• scientific article; zbMATH DE number 4023040 (Why is no real title available?)
• scientific article; zbMATH DE number 1923167 (Why is no real title available?)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Local approximability of max-min and min-max linear programs

This page was built for publication:

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