GNU Linear Programming Kit

<p>The GNU Linear Programming Kit (GLPK) is a <a href="/facts/Software_package_(installation)/kEX4kx7g">software package</a> intended for solving large-scale <a href="/facts/Linear_programming/GduXFQxT">linear programming</a> (LP), <a href="/facts/Mixed_integer_programming/GduXFQxT">mixed integer programming</a> (MIP), and other related problems. It is a set of routines written in <a href="/facts/ANSI_C/rPKeEuPm">ANSI C</a> and organized in the form of a <a href="/facts/Function_(computer_programming)/9vFJrg0A">callable</a> <a href="/facts/Library_(computer_science)/xRzL3P7q">library</a>. The package is part of the <a href="/facts/GNU_Project/mjc8AwM6">GNU Project</a> and is released under the <a href="/facts/GNU_General_Public_License/S75KhLSX">GNU General Public License</a>.
</p><p>GLPK uses the <a href="/facts/Simplex_algorithm/9fndF6cq">revised simplex method</a> and the primal-dual <a href="/facts/Interior_point_method/prIIrceN">interior point method</a> for <a href="/facts/Non-integer_base_of_numeration/Yp7ASnTj">non-integer</a> problems and the <a href="/facts/Branch_and_bound/mhALtav7">branch-and-bound</a> algorithm together with <a href="/facts/Cutting-plane_method/8V7TTfhx">Gomory's mixed integer cuts</a> for (mixed) integer problems.
</p>

GNU Linear Programming Kit open-in-new

GNU Linear Programming Kit