Efficient surrogate optimization for payment cost co-optimization with transmission capacity constraints

Most ISOs in the US minimize the total bid cost and then settle the market based on locational marginal prices. Minimizing the total bid cost, however, may not lead to maximizing the social welfare. Studies indicate that for energy only, payment cost minimization (PCM) leads to reduced payments for a given set of bids, and the “hockey-stick” bidding a less likely to occur. Since co-optimization of energy with ancillary services leads to a more efficient allocation, it is important to solve PCM co-optimization while considering transmission capacity constraints for a comparison with other auction mechanisms. In this paper, PCM is formulated using price definition system-wide constraints. This problem formulation introduces difficulties such as nonlinearity, non-separability and complexity of convex hull. To overcome these difficulties, the nonlinear terms are linearized thereby allowing to be solved by using branch-and-cut. At the same time, the linearization is performed in a way that the “surrogate optimality condition” is satisfied thereby allowing the problem to be solved efficiently.

[1]  P. B. Luh,et al.  Solving payment cost co-optimization problems , 2012, 2012 IEEE Power and Energy Society General Meeting.

[2]  Mikhail A. Bragin,et al.  An efficient surrogate subgradient method within Lagrangian relaxation for the Payment Cost Minimization problem , 2012, 2012 IEEE Power and Energy Society General Meeting.

[3]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[4]  Mikhail A. Bragin,et al.  Payment cost minimization using Lagrangian relaxation and modified surrogate optimization approach , 2011, 2011 IEEE Power and Energy Society General Meeting.

[5]  P. Luh,et al.  On the Surrogate Gradient Algorithm for Lagrangian Relaxation , 2007 .

[6]  Jean-Louis Goffin,et al.  Convergence of a simple subgradient level method , 1999, Math. Program..

[7]  Peter B. Luh,et al.  Convergence of the Surrogate Lagrangian Relaxation Method , 2015, J. Optim. Theory Appl..

[8]  Xu Han,et al.  Payment cost minimization with transmission capacity constraints and losses using the objective switching method , 2010, IEEE PES General Meeting.

[9]  Feng Zhao,et al.  Payment versus bid cost [The Business Scene] , 2008, IEEE Power and Energy Magazine.

[10]  Dimitri P. Bertsekas,et al.  Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..

[11]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[12]  Feng Zhao,et al.  Payment cost minimization auction for deregulated electricity markets using surrogate optimization , 2006, IEEE Transactions on Power Systems.