Re: Least squares OPF

[Carlos E Murillo-Sanchez]

Actually, since the quadratic costs that Mariusz wants are diagonal, it is possible to use the normal polynomial cost mechanism in mpc.gencost (including the cost on the reactive generations; see the footnote in the manual at page 152). carlos. Ray Zimmerman wrote: MATPOWER does not currently include an option for that objective function, but it should be straightforward to implement an extension to do it. With MATPOWER 7, I believe you should be able to do it with the standard quadratic costs in (6.47) in the User’s Manual.    Ray On Jun 17, 2019, at 5:43 AM, m.drabe...@onet.eu wrote: Dear All,     I am currently working on extensions of OPF problem and got one question.   Could you please advise  if Matpower provides any possibility for easy coding of “least squares” OPF problems of the following form:   Minimize   sum( (P_setpoint^i – P_G^i)^2+(Q_setpoint^i – Q_G^i)^2)   Subject to:   standard OPF constraints   Where:  - P_setpoint^i / Q_setpoint^i is the desired output of active/reactive power of generator “i” (parameter known a priori) - P_G^i / Q_G^i  - output of generator “i” (variables)   I am looking forward to your reply.     Best regards, Mariusz Drabecki Wolny od wirusów. www.avg.com