scientific article; zbMATH DE number 1163112

zbMATH Open0911.90251MaRDI QIDQ4394601FDOQ4394601

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

Publication date: 11 June 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

bilevel programmingNash equilibriabranch-and-boundconcave optimizationlinear mixed 0-1 programmingmaxmin problem

Mathematics Subject Classification ID

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

Cited In (12)

• Solving Max-min Relational Equations. Software and Applications
• Title not available (Why is that?)
• Technical Note—On Min-Max Integer Allocation Problems
• Title not available (Why is that?)
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local approximability of max-min and min-max linear programs
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Title not available (Why is that?)

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)