Hi Rurizwan, fmincon is more general than SQP as it supports more general non-linear functions. Also, fmincon and an SQP solver likely implement very different algorithms. So in those senesces they are quite different.
On the other hand, if my understanding of the underlying algorithms is correct, if you are solving a convex quadratic problem, these two methods should produce to the same optimal objective values. Cheers, -Carleton On Feb 10, 2015, at 3:39 PM, Rurizwan Syahru Wibisana <[email protected]<mailto:[email protected]>> wrote: is fmincon solver equal to SQP solver? On Mon, Feb 9, 2015 at 8:19 AM, Ray Zimmerman <[email protected]<mailto:[email protected]>> wrote: Please see FAQ #2<http://www.pserc.cornell.edu/matpower/#homework>. The LMP from an OPF solution can be found in the LAM_P column of results.bus (see Table 6-1 in the User’s Manual<http://www.pserc.cornell.edu/matpower/manual.pdf>). MATPOWER does not implement any SQP solvers. Ray On Feb 7, 2015, at 4:29 AM, Rurizwan Syahru Wibisana <[email protected]<mailto:[email protected]>> wrote: Dear All I have Final Project about transmission cost optimization,please help me to describe how to use Locational Marginal Price and Sequential Quadratic Programming in matpower. Thanks for your time, I hope anyone can help me. ________________________________ The information in this e-mail may be confidential and subject to legal professional privilege and/or copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.
