Lagrangean relaxation-based algorithm for bi-level problems

DOI10.1080/10556788.2014.885519zbMath1325.90068OpenAlexW2136672713MaRDI QIDQ2943804

No author found.

Publication date: 4 September 2015

Published in: Optimization Methods and 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)

Related Items (3)

Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Algorithms for solving the mixed integer two-level linear programming problem
• Discrete linear bilevel programming problem
• An overview of bilevel optimization
• Global optimization of mixed-integer bilevel programming problems
• On the Stackelberg strategy in nonzero-sum games
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• The polynomial hierarchy and a simple model for competitive analysis
• On two-level optimization
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Decentralized multicriteria optimization of linear stochastic systems
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• The Mixed Integer Linear Bilevel Programming Problem

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