Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
From MaRDI portal
Publication:1683064
DOI10.1016/j.ejor.2017.04.013zbMath1375.90149OpenAlexW1622023966MaRDI QIDQ1683064
Ignacio E. Grossmann, Sanjay Mehta, Erdem Arslan, Carlos Florensa, Pratik Misra, Pablo Garcia-Herreros
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.04.013
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)
Related Items (11)
A special three-level optimization problem ⋮ A discontinuous derivative-free optimization framework for multi-enterprise supply chain ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ An investigation of the optimistic solution to the linear trilevel programming problem ⋮ A game-theoretic optimisation approach to fair customer allocation in oligopolies ⋮ A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies ⋮ Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure ⋮ A modification of the trilevel \(K\)th-best algorithm ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms
- Solving ill-posed bilevel programs
- A trilevel programming approach for electric grid defense planning
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Sequential competitive location on networks
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Solutions and properties of multi-stage Stackelberg games
- Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition
- An exact method for the discrete \((r|p)\)-centroid problem
- On locating new facilities in a competitive environment
- Multi-level programming and conflict resolution
- A bilevel programming approach to determining tax credits for biofuel production
- Foundations of bilevel programming
- Bilevel programming in traffic planning: Models, methods and challenge
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Locating facilities in a competitive environment
- Parametric global optimisation for bilevel programming
- Global optimization of mixed-integer bilevel programming problems
- Computational Difficulties of Bilevel Linear Programming
- The polynomial hierarchy and a simple model for competitive analysis
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Necessary optimality conditions in pessimistic bilevel programming
- The Mixed Integer Linear Bilevel Programming Problem
- Modeling Discrete Competitive Facility Location
- Pessimistic Bilevel Optimization
- Generation Capacity Expansion in Imperfectly Competitive Restructured Electricity Markets
This page was built for publication: Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
