Copositive Duality for Discrete Energy Markets

References

• Anstreicher KM (2021) Testing copositivity via mixed–Integer linear programming. Linear Algebra Appl. 609:218–230.Crossref, Google Scholar
• Azizan N, Su Y, Dvijotham K, Wierman A (2020) Optimal pricing in markets with nonconvex costs. Oper. Res. 68(2):480–496.Abstract, Google Scholar
• Baldwin E, Klemperer P (2019) Understanding preferences: Demand types, and the existence of equilibrium with indivisibilities. ECTA 87(3):867–932.Crossref, Google Scholar
• Bertsekas D (2009) Convex Optimization Theory, vol. 1 (Athena Scientific, Belmont, MA).Google Scholar
• Bienstock D, Chen C, Munoz G (2020) Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Programming 183(1–2):105–148.Crossref, Google Scholar
• Bomze IM, De Klerk E (2002) Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global. Opt. 24(2):163–185.Crossref, Google Scholar
• Bomze IM, Frommlet F, Locatelli M (2010) Copositivity cuts for improving SDP bounds on the clique number. Math. Programming 124(1–2):13–32.Crossref, Google Scholar
• Bomze IM, Locatelli M, Tardella F (2008) New and old bounds for standard quadratic optimization: Dominance, equivalence and incomparability. Math. Programming 115(1):31–64.Crossref, Google Scholar
• Bundfuss S, Dür M (2009) An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20(1):30–53.Crossref, Google Scholar
• Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Programming 120(2):479–495.Crossref, Google Scholar
• Carrión M, Arroyo JM (2006) A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Systems 21(3):1371–1378.Crossref, Google Scholar
• Cifuentes D, Dey SS, Xu J (2024) Sensitivity analysis for mixed binary quadratic programming. Vygen J, Byrka J, eds. Internat. Conf. Integer Program. Comb. Opt. (Springer, Cham, Switzerland), 446–459.Google Scholar
• CPLEX IBM ILOG (2022) User’s manual for CPLEX. https://www.ibm.com/docs/en/icos/22.1.1?topic=optimizers-users-manual-cplex.Google Scholar
• Danilov V, Koshevoy G, Murota K (2001) Discrete convexity and equilibria in economies with indivisible goods and money. Math. Soc. Sci. 41(3):251–273.Crossref, Google Scholar
• De Klerk E, Pasechnik DV (2002) Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4):875–892.Crossref, Google Scholar
• Dickinson PJ (2019) A new certificate for copositivity. Linear Algebra Appl. 569:15–37.Crossref, Google Scholar
• Drew JH, Johnson CR (1998) The completely positive and doubly nonnegative completion problems. Linear Multilinear Algebra 44(1):85–92.Crossref, Google Scholar
• Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2):295–320.Crossref, Google Scholar
• Fattahi S, Ashraphijuo M, Lavaei J, Atamtürk A (2017) Conic relaxations of the unit commitment problem. Energy 134:1079–1095.Crossref, Google Scholar
• Gao SY, Simchi-Levi D, Teo CP, Yan Z (2019) Disruption risk mitigation in supply chains: The risk exposure index revisited. Oper. Res. 67(3):831–852.Link, Google Scholar
• Gribik PR, Hogan WW, Pope SL (2007) Market-Clearing Electricity Prices and Energy Uplift (Harvard Kennedy School, Cambridge, MA), 1–46.Google Scholar
• Guo C, Bodur M, Papageorgiou DJ (2022) Generation expansion planning with revenue adequacy constraints. Comput. Oper. Res. 142:105736.Crossref, Google Scholar
• Gurobi Optimization, LLC (2023) Gurobi optimizer reference manual. https://www.gurobi.com.Google Scholar
• Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• Hogan WW, Ring BJ (2003) On minimum-uplift pricing for electricity markets. Electr. Policy Gr 1–30.Google Scholar
• Kim S, Kojima M (2003) Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26:143–154.Crossref, Google Scholar
• Liberopoulos G, Andrianesis P (2016) Critical review of pricing schemes in markets with non-convex costs. Oper. Res. 64(1):17–31.Link, Google Scholar
• Luenberger DG, Ye Y (2015) Linear and Nonlinear Programming (Springer Publishing Company, Incorporated, Cham, Switzerland).Google Scholar
• Mas-Colell A, Whinston M, Green J (1995) Microeconomic Theory (Oxford University Press, New York).Google Scholar
• Milgrom P, Watt M (2022) Linear pricing mechanisms for markets without convexity. Proc. 23rd ACM Conf. Econom. Comput., 300–300.Google Scholar
• MOSEK ApS (2022) The MOSEK optimization toolbox for JuMP manual. http://docs.mosek.com/9.0/toolbox/index.html.Google Scholar
• Ndrio M, Winnicki A, Bose S (2022) Pricing economic dispatch with ac power flow via local multipliers and conic relaxation. IEEE Trans. Control Network Systems 11(3):1704–1716.Crossref, Google Scholar
• O’Neill RP, Sotkiewicz PM, Hobbs BF, Rothkopf MH, Stewart WR Jr (2005) Efficient market-clearing prices in markets with nonconvexities. Eur. J. Oper. Res. 164(1):269–285.Crossref, Google Scholar
• Parrilo PA (2000) Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, Pasadena, CA.Google Scholar
• Quarm E, Madani R (2021) Scalable security-constrained unit commitment under uncertainty via cone programming relaxation. IEEE Trans. Power Systems 36(5):4733–4744.Crossref, Google Scholar
• Ruiz C, Conejo AJ, Gabriel SA (2012) Pricing non-convexities in an electricity pool. IEEE Trans. Power Systems 27(3):1334–1342.Crossref, Google Scholar
• Sherali HD, Adams WP (2013) A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 (Springer Science & Business Media, Berlin, Germany).Google Scholar
• Taylor JA (2015) Convex Optimization of Power Systems (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Vujanic R, Esfahani PM, Goulart P, Morari M (2014) Large scale mixed-integer optimization: A solution method with supply chain applications. 22nd Mediterranean Conf. Control Automation (IEEE, Piscataway, NJ), 804–809.Google Scholar
• Wang G, Shanbhag UV, Zheng T, Litvinov E, Meyn S (2013) An extreme-point subdifferential method for convex hull pricing in energy and reserve markets – Part I: Algorithm structure. IEEE Trans. Power Systems 28(3):2111–2120.Crossref, Google Scholar
• Xu G, Burer S (2018) A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. 70(1):33–59.Crossref, Google Scholar