Solving certain complementarity problems in power markets via convex programming
type: Item
instance of: scholarly article
title: Solving certain complementarity problems in power markets via convex programming
zbMATH Open document ID: 1504.90167
author: G. Constante-Flores
author: Antonio J. Conejo
author: S. Constante-Flores
published in: Top
publication date: 2022-10-19T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7604078
zbMATH Keywords: convex programming
zbMATH Keywords: MPECs
zbMATH Keywords: power markets
describes a project that uses: MATPOWER
describes a project that uses: DCCP
describes a project that uses: APOGEE
describes a project that uses: Gurobi
describes a project that uses: BARON
MaRDI profile type: Publication
full work available at URL: s11750-022-00627-3
OpenAlex ID: W4220978233
cites work: Evaluating the strategic behavior of cement producers: an equilibrium problem with equilibrium constraints
cites work: Q4821526
cites work: Bilevel programming: a survey
cites work: Decision making under uncertainty in electricity markets
cites work: Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach
cites work: Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
cites work: Is bilevel programming a special case of a mathematical program with complementarity constraints?
cites work: Analysis of MILP Techniques for the Pooling Problem
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Complementarity modeling in energy markets
cites work: Introduction to global optimization.
cites work: A survey on mixed-integer programming techniques in bilevel optimization
cites work: Global optimization of bilinear programs with a multiparametric disaggregation technique
cites work: DC programming and DCA: thirty years of developments
cites work: DC Programming and DCA for General DC Programs
cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
cites work: Variations and extension of the convex-concave procedure
cites work: Linear and nonlinear programming.
cites work: BARON: A general purpose global optimization software package
cites work: An SOS1-based approach for solving MPECs with a natural gas market application
cites work: Optimization in engineering. Models and algorithms
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: The Concave-Convex Procedure
cites work: A note on linearized reformulations for a class of bilevel linear integer problems
DOI: 10.1007/S11750-022-00627-3
description: scientific article; zbMATH DE number 7604078