Pitfalls of Zero Voltage Values in
Optimal Power Flow Problems
Abstract
The existence of strictly positive lower bounds on voltage magnitude is taken for granted in optimal power flow problems. Nevertheless, it is not possible to rely on such bounds for a variety of real-world network optimization problems. This paper discusses a few issues related to 0 V assumptions made during the process of deriving optimization formulations in the current-voltage, power-voltage and power-lifted-voltage variable spaces. The differences between the assumptions are illustrated for a 2-bus 2-wire test case, where the feasible sets are visualized. A nonzero relaxation gap is observed for the canonical multiconductor nonlinear power-voltage formulation. A zero gap can be obtained for the branch flow model semi-definite relaxation, using newly proposed valid equalities.
Index Terms:
Optimal power flow, mathematical optimization, nonlinear programming.I Introduction
In the context of ac transmission system optimization, it has generally been established [1] that the nonlinear nonconvex power-voltage formulation of the circuit physics (in polar coordinates, ‘SVP’) is the most scalable, when used with nonlinear programming solvers such as Ipopt [2], MIPS [3] or Beltistos [4]. Other exact formulations, e.g. the rectangular current-voltage (IVR) and the rectangular power-voltage formulation (SVR) result in overall slower computations [1].
The canonical optimal power flow (OPF) problem specification furthermore assumes the existence of a number of bounds, and postulates a generation cost minimization objective. In general authors assume that voltage magnitude has a strictly positive lower bound, thereby excluding the 0 V from the feasible set. Nevertheless, many real-world network optimization problems may not have this property of strictly positive lower bounds, as 1) the values may be missing entirely; or 2) 0 V solutions can not be excluded a-priori. In the author’s experience, such contexts are not far-fetched:
- •
- •
-
•
Harmonic OPF [9] has no magnitude lower bound for the true harmonics (e.g. voltage magnitude at , i.e., the triplen harmonic, can perfectly be 0).
- •
-
•
OPF with HVDC lines has no voltage lower bound on the nodes for a metallic return [12].
In grounded three-phase four-wire networks, the neutral current may be (close to) zero due to balanced loading, so excluding the 0 V neutral solution may be impossible. Allowing 0 V values causes real algorithmic problems for SVR [11]:
-
•
0 V solutions were naturally found by Ipopt;
-
•
the solution obtained was very sensitive to variable initialization, i.e. different nodes ended up at 0 V;
-
•
it led to convergence problems, requiring much larger computation time than the IVR form;
-
•
solutions were likely to be strictly locally optimal.
Similarly, polynomial chaos OPF paper [8] observed a significant computational speedup using IVR over SVR.
Therefore, this paper showcases a number of pitfalls related to 0 V assumptions and solutions in the feasible sets of OPF in different variable spaces. The 0 V solutions lead to problems in the lifting of Kirchhoff’s current law (KCL) to power variables. Furthermore, loads and generators are often assumed to be connected between a phase and the neutral at 0 V, and dropping this assumption requires attention to detail.
The paper is structured as follows. First we derive a variety of formulations in a consistent notation, which are compared numerically next on a 2-bus 2-wire (explicit neutral) power flow case study222Extensive numerical results with 0 V issues available in [8, 11].. Finally we present some conclusions and directions of future work.
II Derivation of Formulations
Fig. 1 illustrates the definitions of the current, voltage and power variables and indices used in this paper.

We will explore the following three-phase four-wire a.k.a. unbalanced rectangular formulations:
-
•
NLP unbalanced IVR form, presented in [11];
-
•
NLP SVR form, with extensions to avoid violation of KCL in loads/generators, as discussed in [11];
-
•
Branch flow model (BFM) SDP relaxation [13], extended to avoid violation of KCL in load/generators.
We derive the n-conductor expressions in a consistent notation in vector-matrix variables, but illustrate for a 2-wire system with phase and an explicit neutral . We ignore branch shunt terms for brevity, and refer to [14] for a treatment of 4-wire OPF with asymmetric -model branches, and bus shunts.
II-A Current-Voltage (IVR)
The complex voltage vector at bus , a.k.a. phasor, stacks the values of the nodes at buses ,
(1) |
For a two-wire set of electromagnetically coupled conductors, we end up with a impedance matrix, capturing the self-impedance (diagonal) and mutual impedance (off-diagonal). By taking the matrix inverse, we obtain the admittance,
(2) |
Note that, based on the physics (Carson/Pollaczek eq.), we expect that and are symmetric and positive definite. We define the complex current vector in branch in the direction of to to stack the individual values for each of the wires,
(3) |
The branch currents satisfy,
(4) |
The multiconductor ac Ohm’s law is,
(5) |
The power flow into the branch is,
(6) |
where ‘’ indicates the element-wise product. The current vector for a generator is,
(7) |
and by convention flows from the generator to the bus it is connected to, in each of its wires. Note that conservation of current applies through the generator,
(8) |
The power from the generator through each of the wires is,
(9) |
For loads, the current flows from the bus to the load,
(10) |
Conservation of current through the load is,
(11) |
The power flowing through each of the wires to the load is,
(12) |
To force the load value (i.e. constant-power set point), we account for the voltage drop over the load, i.e. ,
(13) |
We now continue to expand the RHS, and use (11) and (12),
(14) |
and finally obtain,
(15) |
Note that this does not imply conservation of current,
(16) |
The effective dispatch value for a generator is,
(17) |
Finally, KCL at bus is,
(18) |
II-B Canonical Power-Voltage (SVR-1)
We state Ohm’s law (5) in admittance form,
(19) |
and substitute this into (6) to obtain power flow vector into the branch in the direction of to ,
(20) |
We lift KCL (18) to power variables (vectors with the same sizes as the original current vectors in (18)), by taking the conjugate and multiplying element-wise with ,
(21) |
When we allow 0 V entries in , the lifted KCL is a relaxation, as it does not imply current-based KCL (18), due to (possible) multiplication with 0 V. This is equivalent to adding a slack variable to the original KCL, e.g. when 0 V:
(22) |
As we are working with complex values, actually represents two degrees of freedom, which can be exploited by optimization solvers.
II-C Power-Voltage Extension (SVR-2)
Even though SVR-1 has proven to work well to optimize three-phase Kron-reduced four-wire networks with only wye loads333In this case conservation of current can be arbitrarily satisfied, as the resulting neutral current residual can flow into the ground unimpeded. , we need to strengthen the feasible set when we model loads/generators between phases (‘delta’) or phase-to-neutral444Neutral that is not exactly 0 V.. Constraints (15),(17) are insufficient in general, as they do not imply (8) or (11). To resolve this, we use the variables and add the constraints (8), (9), (11), (12).
II-D Canonical Power-Lifted-Voltage BFM (SWR-1)
We define lifted variables for voltage, , current, , and power, ,
(23) |
where superscript ‘H’ indicates the conjugate transpose. Note that the substitutions don’t destroy any information555Up to a complex scale factor, see [15]., as long as are not the zero vector - individual entries being zero is fine. The power variable is a square matrix, and therefore distinct from the vector , however they are related,
(24) |
We can construct a block matrix based on the lifted variables,
(25) |
In convex relaxation schemes, this constraint gets cast as,
(26) |
and the rank constraint is dropped to obtain a semi-definite programming formulation. Ohm’s law (5) is multiplied with its own conjugate transpose to obtain,
(27) |
Furthermore, by multiplying Ohm’s law (5) on the right with and using (4), we obtain,
(28) |
Combining (21) with (24), we have the BFM formulation with a diagonal KCL expression, as proposed by Gan and Low [13].
II-E Power-Lifted-Voltage BFM Extension (SWR-2)
We now generalize the definitions of the load and generator power to matrix variables as well666Matrix generalizations add a bar above the original symbol.,
(29) |
We can partition based on the rows,
(30) |
and recognize that (11) implies,
(31) |
Similarly, for generators we obtain,
(32) |
We note valid equalities of the matrix variables w.r.t. the vector-style ones previously defined,
(33) |
Note that we do not project KCL on the rows of or in a similar fashion to (31)-(32). Due capacitive coupling to earth as well as grounding of the neutral, the current through a branch does not in general sum to zero. Finally we generalize KCL, using the matrix variables ,
(34) |
II-F Voltage Bounds
For visualizing the feasible sets we enforce voltage bounds,
(35) |
By setting for instance to 0.9 pu, we typically exclude the low-voltage solution to quadratic equality (13).
II-G Feasible sets and generalizations
Table I summarizes the variables and constraints for five optimization formulation variants, using the previously-defined constraints.
Formulation | IVR | SVR-1 | SVR-2 | SWR-1 | SWR-2 |
---|---|---|---|---|---|
BFM | BIM | BFM | |||
Math. structure | nonconvex QCQP | SDP | |||
Solver | Ipopt [2] | Clarabel [16] | |||
Objective | |||||
Variables | |||||
Bus KCL | (18) | (21) | (21) | (21) | (34) |
Ohm’s law | (5) | (20) | (20) | (27) | (27) |
Branch power | - | - | - | , (28) | , (28) |
Load power | (12) | - | (12) | - | - |
Load set point | (15) | (15) | (15) | (15) | (15) |
Load current | (11) | - | (11) | - | (31) |
Generator power | (9) | - | (9) | - | - |
Generator dispatch | (17) | (17) | (17) | (17) | (17) |
Generator current | (8) | - | (8) | - | (31) |
Voltage bounds | (35) | (35) | (35) | (35) | (35) |
Implementation of these equations in nonlinear optimization frameworks typically requires translating the complex-valued expressions to sets of equivalent real-valued ones. Furthermore, lines should be modelled with shunt admittances, typically used to represent capacitive behavior w.r.t earth. Note that in general grid codes specify phase-to-neutral voltage magnitude limits, not phase-to-ground. Geth and Ergun [14] present the corresponding real-value expressions, and derive expressions for a variety of bounds. Claeys et al. [17] propose a framework to represent unbalanced transformers across variable spaces.
III OPF for a 2-bus 2-wire case
Note that extensive numerical results showcasing 0 V issues ( networks, up to 2156 nodes) have been published in papers [8, 11] co-authored by this paper’s author. Therefore, in this work, the focus is to provide insight, using a 2-bus test case (data in Table II). The problems are implemented in JuMP [18]. The nonconvex formulations are solved with Ipopt [2]; the semidefinite relaxation is solved with Clarabel [16]. We solve repeatedly for different values in the objective, to sample the edge of the solution space.
Voltage source setup | , |
---|---|
Line resistance | = |
Line reactance | = |
Load set point | |
Voltage bounds | , |
Note that this is actually a power flow simulation, i.e. feasibility, problem, as with no physical degree of freedom, as the generator needs to produce a specific amount of power to satisfy the demand, taking into account the branch losses. As will be shown though, only IVR has a single (high-voltage) solution, all other forms have multiple solutions. The solutions sets are visualized in Fig. 2 and are discussed next.

III-A Numerical results: amount of solutions
III-A1 IVR has a single solution
The solution to this problem is uniquely specified by the voltage phasor at bus , i.e.,
(36) |
and a phase-to-neutral voltage magnitude of pu. The generator output is, . This solution is that of the circuit in Fig. 1.
III-A2 SVR-2 has two solutions
The IVR solution is feasible w.r.t. SVR-2, however SVR-2 has a second spurious solution,
(37) |
associated with generator dispatch, . The relaxation gap of this solution is . The voltage drop across the load differs, with the phase-to-neutral voltage magnitude at where it was pu for IVR. With the neutral being hard grounded at both buses, this solution is equivalent to that of a transformed circuit with Kron’s reduction of the neutral (pu).
This spurious solution is that of the circuit in Fig. 3a, where the neutral at bus is grounded. The existence of two distinct solutions suggests the problem for bigger networks has combinatorial (discontinuous) features, which may limit the performance of many algorithms, including the NLP interior-point algorithm in Ipopt.

III-A3 SVR-1 has infinite solutions
A two-dimensional infinite set of solutions is feasible w.r.t. SVR-1. Note that the IVR solution is on the edge of this set, whereas the spurious SVR-2 solution is on the interior. Despite the IVR solution being on the edge, it is not in an ideal location, as it does not align with the minimum active power search direction, so likely leads to nonzero relaxation gap under a broad range of objectives.
For the 2-bus network, the combination of dropping the load KCL and allowing the 0 neutral voltage solution is equivalent to the solutions of the circuit presented in Fig. 3b, where a variable complex current source is added to the bus . The solution is,
(38) |
with phase-to-neutral voltage magnitude at pu. The generator output is , i.e. a gap of
III-A4 SWR-2 has infinite solutions
The solution space is a 1-dimensional infinite set. The IVR solution is an extreme point on this line, in the direction of minimum apparent power, therefore leading to a zero relaxation gap across a broad range of real-world objectives. The 0 V SVR-2 solution is not in the feasible set of SWR-2.
III-A5 SWR-1 has infinite solutions
The solution space is a 2-dimensional infinite set, with a nonzero gap. We do not establish if it is comparable with SVR-1. The solution is the same as that of SVR-1.
III-B Discussion
The exclusion of the 0 V solution in SWR-2 is due to the combination of 1) KCL as a matrix equality 2) conservation of current through loads/generators. Adding either constraint individually to SWR-1 is not sufficient to obtain a 0 gap. That suggests the spurious solution in SVR-2 can be excluded by also using the matrix KCL (34) and generalizing (20) to the outer product (instead of element-wise). Alternatively, as voltages are inherently relative, we can also choose to redefine the ground voltage value, at for instance 1 V.
Modelling loads with a nonzero voltage at both terminals requires additional constraints. In SVR-2, the current variables could still be eliminated in favor of power variables (i.e. as ), following the approach in [11], but this may result in higher order polynomial expressions. Furthermore, constant-power three-phase loads have multiple solutions, with the amount depending on the configuration and neutral grounding impedance [19, 20]. Deriving valid bounds to exclude the ‘low-voltage solution’ may speed up the computation.
IV Conclusions
In the absence of voltage magnitude lower bounds, the ‘exact’ canonical unbalanced power-voltage formulation is a relaxation of the circuit laws with a nonzero gap. Conversely, the unbalanced SDP BFM formulation - often trivialized for its theoretical inexactness, has a zero gap under the same conditions. The nonzero gap solution permitted by the power-voltage formulation, itself characterized by a zero voltage on one of the bus terminals, can furthermore be proven infeasible by the SDP relaxation. In what amounts to a reversal of fortune w.r.t. transmission-style (positive-sequence) OPF in terms of reliability, convergence and gap, with SDP now performing better than NLP, bound tightening based on a convex relaxation could be performed to generate valid lower bounds for the power-voltage form, thereby making the solution unique again.
References
- [1] J. Kardoš, D. Kourounis, O. Schenk, and R. Zimmerman, “Complete results for a numerical evaluation of interior point solvers for large-scale optimal power flow problems,” arXiv:1807.03964, 2018.
- [2] A. Wächter and L. Biegler, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Math. Program., vol. 106, no. 1, pp. 25–57, 2006.
- [3] R. D. Zimmerman, C. E. Murillo-Sánchez, and R. J. Thomas, “Matpower: Steady-state operations, planning, and analysis tools for power systems research and education,” IEEE Trans. Power Syst., vol. 26, no. 1, pp. 12–19, 2011.
- [4] J. Kardoš, D. Kourounis, O. Schenk, and R. Zimmerman, “BELTISTOS: A robust interior point method for large-scale optimal power flow problems,” Elect. Power Syst. Res., vol. 212, p. 108613, 2022.
- [5] T. Van Acker, D. Van Hertem, D. Bekaert, K. Karoui, and C. Merckx, “Implementation of bus bar switching and short circuit constraints in optimal power flow problems,” in IEEE PowerTech, 2015.
- [6] A. K. Barnes, J. E. Tabarez, A. Mate, and R. W. Bent, “Optimization-based formulations for short-circuit studies with inverter-interfaced generation in PowerModelsProtection.jl,” Energies, vol. 14, no. 8, 2021.
- [7] T. Mühlpfordt, T. Faulwasser, and V. Hagenmeyer, “Solving stochastic ac power flow via polynomial chaos expansion,” in IEEE Conf. Control App., 2016, pp. 70–76.
- [8] T. Van Acker, F. Geth, A. Koirala, and H. Ergun, “General polynomial chaos in the current–voltage formulation of the optimal power flow problem,” Elect. Power Syst. Res., vol. 211, p. 108472, 10 2022.
- [9] F. Geth and T. Van Acker, “Harmonic optimal power flow with transformer excitation,” Elect. Power Syst. Res., vol. 213, p. 108604, 12 2022.
- [10] L. R. de Araujo, D. R. R. Penido, and F. de Alcântara Vieira, “A multiphase optimal power flow algorithm for unbalanced distribution systems,” Int. J. Elect. Power Energy Syst., vol. 53, pp. 632–642, 2013.
- [11] S. Claeys, F. Geth, and G. Deconinck, “Optimal power flow in four-wire distribution networks: Formulation and benchmarking,” Elect. Power Syst. Res., vol. 213, p. 108522, 12 2022.
- [12] C. K. Jat, J. Dave, D. Van Hertem, and H. Ergun, “Unbalanced opf modelling for mixed monopolar and bipolar hvdc grid configurations,” 2022. [Online]. Available: https://arxiv.org/abs/2211.06283
- [13] L. Gan and S. H. Low, “Convex relaxations and linear approximation for optimal power flow in multiphase radial networks,” in Proc. Power Syst. Comp. Conf., 2014.
- [14] F. Geth and H. Ergun, “Real-value power-voltage formulations of, and bounds for, three-wire unbalanced optimal power flow,” arXiv:2106.06186, pp. 1–12, 2021.
- [15] F. Geth and C. Coffrin, “Direct method to recover current and voltage in multi-conductor optimal power flow models,” in IEEE Power Energy Soc. General Meeting, 2019, pp. 1–5.
- [16] P. Goulart and Y. Chen. [Online]. Available: https://oxfordcontrol.github.io/ClarabelDocs/stable/
- [17] S. Claeys, G. Deconinck, and F. Geth, “Decomposition of n-winding transformers for unbalanced optimal power flow,” IET Gen. Trans. Distrib., vol. 14, pp. 5816–5822, 12 2020.
- [18] I. Dunning, J. Huchette, and M. Lubin, “JuMP: A modeling language for mathematical optimization,” SIAM Rev., vol. 59, no. 2, pp. 295–320, 2017.
- [19] L. R. de Araujo, D. R. R. Penido, S. Carneiro, and J. L. R. Pereira, “A study of neutral conductors and grounding impacts on the load-flow solutions of unbalanced distribution systems,” IEEE Trans. Power Syst., vol. 31, pp. 3684–3692, 9 2016.
- [20] Y. Wang and W. Xu, “The existence of multiple power flow solutions in unbalanced three-phase circuits,” IEEE Trans. Power Syst., vol. 18, no. 2, pp. 605–610, 2003.