Linear programing relaxations for a strategic pricing problem in electricity markets

DOI10.1111/itor.12293zbMath1358.90105OpenAlexW2578585347MaRDI QIDQ2968496

Wagner Pimentel, Márcia H. C. Fampa

Publication date: 16 March 2017

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12293

zbMATH Keywords

semidefinite relaxationcutting plane algorithmstrategic pricinglinear programing relaxation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Basic theoretical foundations and insights on bilevel models and their applications to power systems ⋮ Classification model for bid/no‐bid decision in construction projects

Uses Software

• CPLEX
• Biq Mac

Cites Work

• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Bilevel optimization applied to strategic pricing in competitive electricity markets
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• On the Shannon capacity of a graph
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite relaxation and nonconvex quadratic optimization
• Semidefinite relaxation for linear programs with equilibrium constraints
• An application of genetic algorithm to a bidding problem in electricity markets