#### G.2 CLP – COIN-OR Linear Programming

The CLP [37] (COIN-OR Linear Programming) solver is an open-source linear
programming solver written in C++ by John Forrest. It can solve both linear
programming (LP) and quadratic programming (QP) problems. It is primarily meant to
be used as a callable library, but a basic, stand-alone executable version exists as well. It is
available from the COIN-OR initiative at https://github.com/coin-or/Clp.

To use CLP with Matpower, a MEX interface is
required .
For Microsoft Windows users, a pre-compiled MEX version of CLP (and numerous other
solvers, such as GLPK and Ipopt) are easily installable as part of the OPTI
Toolbox [49]

With the Matlab interface to CLP installed, it can be used to solve DC OPF
problems by setting the opf.dc.solver option equal to 'CLP'. The solution algorithms and
other CLP parameters can be set directly via Matpower’s clp.opts option. A “CLP user
options” function can also be speciﬁed via clp.opt_fname to override the defaults for any
of the many CLP parameters. See help clp for details. See Table C-8 for a summary of
the CLP-related Matpower options.

CLP can also be used to solve general LP and QP problems via Matpower’s common
QP solver interface qps_matpower with the algorithm option set to 'CLP', or by calling
qps_clp directly.