Tulip interior point solver

A new open source linear programming solver named Tulip.jl and written in pure Julia is now available. The source code is licensed under the Mozilla Public License 2.0 and is hosted on GitHub:

Tulip.jl can be called from the JuMP library, the latter allows one to conveniently build an optimization problem and then invoke the solver. Tulip.jl also offers a direct API.

Tulip.jl implements an interior‑point method as described in Tanneau et al (2021). The solver has been tested on power systems operations problems and apparently performs well. Tanneau et al refer to Anjos et al (2019) in this context.

Please reply if you have relevant experiences to report.

References

Anjos, Miguel F, Andrea Lodi, and Mathieu Tanneau (January 2019). “A decentralized framework for the optimal coordination of distributed energy resources”. IEEE Transactions on Power Systems. 34 (1): 349–359. ISSN 1558‑0679. doi:10.1109/TPWRS.2018.2867476. Paywalled. :closed_access:

Tanneau, Mathieu, Miguel F Anjos, and Andrea Lodi (1 September 2021). “Design and implementation of a modular interior-point solver for linear optimization”. Mathematical Programming Computation. 13 (3): 509–551. ISSN 1867‑2957. doi:10.1007/s12532-020-00200-8. arXiv preprint.

Text and images licensed under CC BY 4.0Data licensed under CC0 1.0Code licensed under MITSite terms of serviceOpenmod mailing listOpenmod wiki. Openmod YouTube.