Lagrangean relaxation-based algorithm for bi-level problems

DOI10.1080/10556788.2014.885519MaRDI QIDQ2943804zbMATH OpenOpenAlexFDO

Authors

Publication date 4 September 2015

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2014.885519

zbMATH Keywords

Lagrangean relaxationsub-gradient methodmixed-integer bi-level programmingcompetitive bi-level capacitated facility location problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Continuous location (90B85)

Recommendations

• Enhancing the solution method of linear bi-level programming problem based on enumeration method and dual method
• New solutions to a special class of nonlinear bi-level programming problem
• A genetic approach for solving bi-level programming problems
• scientific article; zbMATH DE number 35514
• A value-function-based exact approach for the bilevel mixed-integer programming problem

Cites work

• scientific article; zbMATH DE number 35514 (Why is no real title available?)
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Algorithms for solving the mixed integer two-level linear programming problem
• An overview of bilevel optimization
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Decentralized multicriteria optimization of linear stochastic systems
• Discrete linear bilevel programming problem
• Global optimization of mixed-integer bilevel programming problems
• New Branch-and-Bound Rules for Linear Bilevel Programming
• On the Stackelberg strategy in nonzero-sum games
• On two-level optimization
• The Mixed Integer Linear Bilevel Programming Problem
• The polynomial hierarchy and a simple model for competitive analysis

Cited in

(7)

• scientific article; zbMATH DE number 6001259 (Why is no real title available?)
• scientific article; zbMATH DE number 5173819 (Why is no real title available?)
• scientific article; zbMATH DE number 4016054 (Why is no real title available?)
• An effective bilevel programming approach for the evasive flow capturing location problem
• Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem
• Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
• Bilevel optimization: theory, algorithms, applications and a bibliography

This page was built for publication: Lagrangean relaxation-based algorithm for bi-level problems

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