A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs
From MaRDI portal
Publication:2005902
DOI10.1007/s11067-019-9440-7OpenAlexW2883188584WikidataQ128308913 ScholiaQ128308913MaRDI QIDQ2005902
Juan M. Morales, Kerstin Dächert, Steven A. Gabriel, Javier Saez-Gallego, Sauleh Ahmad Siddiqui
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.09340
Calculus of variations and optimal control; optimization (49-XX) Operations research, mathematical programming (90-XX)
Uses Software
Cites Work
- Unnamed Item
- An SOS1-based approach for solving MPECs with a natural gas market application
- Removing cross-border capacity bottlenecks in the European natural gas market -- a proposed merchant-regulatory mechanism
- On the representation of the search region in multi-objective optimization
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- Solving mathematical programs with equilibrium constraints
- A stochastic multi-agent optimization model for energy infrastructure planning under uncertainty in an oligopolistic market
- Network expansion to mitigate market power
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Efficient computation of the search region in multi-objective optimization
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Electric power network oligopoly as a dynamic Stackelberg game
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Proper efficiency and the theory of vector maximization
- Bicriteria Transportation Problem
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- Multicriteria Optimization
- Mathematical Programs with Equilibrium Constraints
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
