GLOP

{{Short description|Google program}}

{{About|the linear programming solver|the multicast address allocation method|Multicast address#GLOP addressing}}

GLOP (the Google Linear Optimization Package) is Google's open-source linear programming solver, created by Google's [https://research.google/teams/operations-research/ Operations Research Team]. It is written in C++ and was released to the public as part of Google's OR-Tools software suite in 2014.{{cite web |url=https://ai.googleblog.com/2014/09/sudoku-linear-optimization-and-ten-cent.html |title=Sudoku, Linear Optimization, and the Ten Cent Diet}}

GLOP uses a revised primal-dual simplex algorithm optimized for sparse matrices. It uses Markowitz pivoting to reduce matrix fill-in, steepest-edge pricing to avoid degenerate pivots, and an LU decomposition tailored for sparse matrices.

Inside Google, GLOP is used to stabilize YouTube videos{{cite web |url=https://ai.googleblog.com/2014/09/sudoku-linear-optimization-and-ten-cent.html |title=Sudoku, Linear Optimization, and the Ten Cent Diet}} and outside Google, it has been used to perform fast linear relaxations for reinforcement learning.{{cite web |url=http://papers.nips.cc/paper/9024-a-structured-prediction-approach-for-generalization-in-cooperative-multi-agent-reinforcement-learning |title=A structured prediction approach for generalization in cooperative multi-agent reinforcement learning}}