WorksMathematics
Second-Order Cone Valid Inequalities for Set-Point Tracking with Energy Storage
Abstract
Convex relaxations of energy storage models drop the complementarity constraints that forbid simultaneous charging and discharging. In the set-point tracking problem, the relaxation can then charge and discharge simultaneously at no cost, as the tracking error depends only on the net power of the storage. We show that the convex hull of the single-period epigraph of the tracking error, under complementarity, is the epigraph of a parabolic cylinder. The resulting second-order cone inequality adds to the tracking error a penalty on the product of the charging and discharging powers and is the tightest convex member of the pencil of quadrics through the two branches of the epigraph. With power limits and the mode variable, the hull is given by the perspective reformulation of the two modes, which dominates the cylinder. In 20000 instances, the cylinder reduces the hours with simultaneous charging and discharging by more than 99% and yields an optimal schedule in 98.8% of them.
Introduction
Storage models need complementarity constraints, written with bilinear equalities or binary variables, to prevent charging and discharging in the same period; their convex relaxations drop them and may return infeasible schedules [1]. Valid inequalities that strengthen the relaxation reduce this effect: Pozo [2] describes the convex hull of the single-period storage set, and Elgersma et al. [3] extend it to reserve provision. These inequalities act on the feasible set and leave the objective function untouched. Al Taha and Bitar [4] instead eliminate the power variables through a piecewise-affine bijection with the state-of-charge profiles, whose feasible set is convex; the nonconvexity remains in the mapping, so the power variables may appear only in the objective function, which stays convex if it is nondecreasing in the charging power. In the set-point tracking problem, the relaxation is weak precisely because of its objective: the tracking error depends only on the net power, so charging and discharging simultaneously is free [2]; it also violates the condition of [4] whenever the set-point asks the storage to charge.
This letter shows that the convex hull of the single-period epigraph of the tracking error under complementarity is the epigraph of a parabolic cylinder, which yields a second-order cone (SOC) inequality that penalizes simultaneous charging and discharging Section III. We identify this cylinder as the tightest convex member of the pencil of quadrics through the epigraph, extend the result to power limits through the perspective reformulation of the operating modes, and show that the cut nearly eliminates simultaneous charging and discharging in 20 000 instances (§ 3).
Set-Point Tracking Problem
Let , , and denote the discharging power, the charging power, and the state of charge of the storage in period . Its operational set is
where and are the power limits, is the state-of-charge range, are the efficiencies, is the period length, and is given. The complementarity constraints (1d) can be written with a binary variable per period and the power limits and [2].
The set-point tracking problem (STP) seeks the operation of the storage that best follows a power signal [2]:
Its natural relaxation drops (1d) (or relaxes to ). As the tracking error depends only on the net power, the relaxation can increase both and at no cost, and often does so to meet the state-of-charge limits [2]. To strengthen the objective, we write (2) in epigraph form, with one variable per period:
where
As (3) is linear in , the tightest convex relaxation that can be built from each set alone is its convex hull.
The Convex Hull of the Epigraph
We omit the subscript and write for . The set is the union of two convex sets, the epigraphs of the pure-discharge parabola on the plane and of the pure-charge parabola on the plane ; these
J. M. Morales is with the research group OASYS, University of Málaga, Málaga 29071, Spain. E-mail: [email protected]. This work was supported by the Consejería de Universidad, Investigación e Innovación de la Junta de Andalucía through project DGP-PIDI-2024-00851. The author thankfully acknowledges the computer resources, technical expertise, and assistance provided by the SCBI (Supercomputing and Bioinformatics) center of the University of Málaga. parabolas are the two branches of (thick curves in Figure 1a). Its convex hull is the epigraph of the parabolic cylinder

Figure 1. Tracking error for . (a) Branches of (thick), rulings of the cylinder (5) (solid), and natural relaxation along the segments (dashed). (b) Members (cylinder), (paraboloid), and (natural relaxation) of the pencil (7) along , with ; the SOC cut removes the shaded area; dots: points of . (c) Top view of the hull with power limits and : rulings of the cylinder and, where , of the cone (11) with apex at the full-discharge point (dot).
Theorem 1. .
Proof. The set is convex, because is a convex quadratic function. On , , so and . Hence and . Conversely, let , with throughput and slack . If , the point belongs to . Otherwise, let and take the points that discharge or charge at power , with their tracking errors raised by ,
Both belong to , as , and with
because and . As , this convex combination of two points of is . □
Thus, along each segment , the hull is the chord between the pure-discharge and pure-charge points with throughput $r (Figure 1a). The SOC cut can be written as
that is, the tracking error plus a penalty on simultaneous charging and discharging, which vanishes on . It is a convex quadratic, hence SOC-representable, constraint that does not involve the binary variables, so it can be added to any relaxation of . No epigraph variables are needed: replacing the objective of (2) with yields the same relaxation as a convex quadratic program.
Is the cylinder unique?
The cylinder belongs to the pencil of quadrics that contain the two branches of , which, following [5 Thm. 4.1], we write as with
All members coincide on the planes and , and the Hessian of , with diagonal entries 2 and off-diagonal entries , is positive semidefinite if and only if and singular if and only if , the two cylinders of the pencil. For , is the cylinder of Theorem 1, with rulings parallel to in the space ; for , is the tracking error itself, i.e., the objective of the natural relaxation, with rulings parallel to . Since , is non-decreasing in , so the cylinder is the tightest convex member and the cylinder the weakest (Figure 1b). Hence the cylinder is not unique, but it is the only one that yields the convex hull.
Power Limits: Perspective Reformulation
Theorem 1 ignores the power limits. With them, the cylinder remains valid but need not give the hull. In formulations that keep the mode variable , the single-period set is
whose projection onto is with the power limits. In each mode, the tracking error is a convex function of one power, or , and the hull of such a disjunction follows from their perspectives [6]. Let
with the convention .
Proposition 1. . With two auxiliary variables , the inequality is equivalent to the SOC constraints
where (10b) and (10c) are the rotated cones and , as , .
Proof. The set is convex, as the projection of a set defined by linear and SOC constraints, and contains : if , then and ; if , then and . Hence . Conversely, let , with slack . Its bounds give ; if , it is in by the cases above. Otherwise, and , so and belong to , and with , because and . As , this convex combination of two points of is .
Physically, a fractional splits the period: the storage discharges at power during a fraction and charges at power during the rest, and is the time average of the two tracking errors, whereas the natural relaxation takes the error of the average net power.
The perspective inequality dominates the cylinder: by the Cauchy–Schwarz inequality, , so , with equality iff , i.e., . The cylinder is thus the perspective inequality for the best time split, where both modes run at power , as and in the proof of Theorem 1.
The limits and confine to the interval , which requires . As projection and convex hull commute, minimizing over this interval gives the hull of with power limits (Figure 1c). Where , the split is feasible and the hull is the cylinder. Where, say, , it would discharge above , and, being convex in , the minimum is attained at the closest feasible split, , which discharges at full power, . Substituting it in (9),
These points lie on segments that join the full-discharge point with the pure-charge points, so (11) is a cone with apex at the former: with denoting its affine terms, it reads .
If appears only in the power limits, as in the natural relaxation, the optimizer chooses it to minimize , and (10) yields the hull of Figure 1c: it tightens the cylinder only where , and nowhere if , since then implies . They pay off when is coupled with other constraints (e.g., mode-dependent costs or reserves), at the price of two rotated cones per period; the cylinder needs neither nor auxiliary variables.
Case Study
As in [2], a household with a 35-kW photovoltaic (PV) system uses a battery to follow its net demand over hours; the first 200 daily PV profiles and the 100 battery configurations of [7] yield 20 000 instances. We solve the MIQP that models (1d) with binary variables; the quadratic relaxation based on the HCH model of [2] (HCH-QP); HCH-QP with the cylinder as convex QP objective (HCH-SOC); and HCH-QP with (10) (HCH-PER), with Gurobi 13.0.2 (MOSEK 10.2.0 for HCH-PER) through AMPL, on a 2.6 GHz CPU with 2 GB RAM, one thread and default settings; times are solver CPU times reported by AMPL. See [8] for data and code.
| (%) | (kW) | Gap (%) | Time (ms) | Time red. (%) | |
| MIQP | 0 | 0 | — | 33.63 | — |
| HCH-QP | 15.87 | 104.44 | −1.34 | 14.86 | 55.82 |
| HCH-SOC | 0.08 | 0.04 | −0.0004 | 14.66 | 56.40 |
| HCH-PER | 0.08 | 0.04 | −0.0004 | 20.39 | 39.36 |
Table 1. Results for the set-point tracking problem (20 000 instances).
Table I reports, as in [2], the hours with kW, the average and gap to the MIQP optimum, and the average time and its reduction with respect to the MIQP. The cylinder removes 99.5% of the hours with simultaneous charging and discharging and 99.96% of , and nearly closes the gap of HCH-QP. In 19750 instances (98.8%), HCH-SOC returns a schedule without simultaneous charging and discharging. Such a schedule is feasible for (2) and, as the penalty in (6) vanishes, its tracking error equals the lower bound given by the relaxation, so it is optimal; the MIQP confirms it (relative tolerance ). The other 250 involve 11 small batteries with low efficiencies, which suggests a coupling of periods through the state-of-charge limits that a single-period hull cannot capture. HCH-PER gives the same bounds at a higher cost: in 99 batteries, but no hour with simultaneous charging and discharging reaches , where the perspective is tighter (Section III-A). HCH-SOC is as fast as HCH-QP, whose optima are not unique: the tracking error fixes only the net power , so every feasible split of it into charging and discharging is optimal, and the solver picks one.
Conclusions
The convex hull of the single-period epigraph of the tracking error under complementarity is the epigraph of a parabolic cylinder, the tightest convex quadric through its two branches. The resulting SOC inequality penalizes simultaneous charging and discharging without binary variables and nearly eliminates it. With power limits and the mode variable, the perspective reformulation gives the single-period hull. Future work will address several units and multi-period hulls.
References
- [1]J. M. Arroyo, L. Baringo, A. Baringo, R. Bolaños, N. Alguacil, and N. G. Cobos, “On the use of a convex model for bulk storage in MIP-based power system operation and planning,” IEEE Trans. Power Syst., vol. 35, no. 6, pp. 4964–4967, 2020.DOI
- [2]D. Pozo, “Convex hull formulations for linear modeling of energy storage systems,” IEEE Trans. Power Syst., vol. 38, no. 6, pp. 5934–5936, 2023.DOI
- [3]M. Elgersma, M. Morales-España, K. I. Aardal, N. Helistó, J. Kiviluoma, and M. M. de Weerdt, “Tight MIP formulations for optimal operation and investment of storage including reserves,” IEEE Trans. Power Syst., vol. 41, no. 4, pp. 2428–2440, 2026.arxiv.org/abs/2411.17484
- [4]F. Al Taha and E. Bitar, “When are lossy energy storage optimization models convex?” in Proc. IEEE Power & Energy Soc. Gen. Meeting (PESGM), Austin, TX, USA, Jul. 2025, pp. 1–5.
- [5]P. Belotti, J. C. Gómez, I. Polik, T. K. Ralphs, and T. Terlaky, “On families of quadratic surfaces having fixed intersections with two hyperplanes,” Discrete Appl. Math., vol. 161, no. 16-17, pp. 2778–2793, 2013.DOI
- [6]S. Ceria and J. Soares, “Convex programming for disjunctive convex optimization,” Math. Program., vol. 86, no. 3, pp. 595–614, 1999.DOI
- [7]D. Pozo, “Appendix and dataset: Convex hull formulations for linear modeling of energy storage systems,” 2023, [Online]. Available: https://github.com/DavidPozo/ESS_data.DOI
- [8]OASYS, “Data and code for second-order cone valid inequalities for set-point tracking with energy storage,” 2026. [Online]. Available: https://github.com/groupoaysys/storage_valid_inequalities