The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library. The package is part of the GNU Project and is released under the GNU General Public License.

Problems can be modeled in the language GNU MathProg which shares many parts of the syntax with AMPL and solved with standalone solver GLPSOL.

GLPK can also be used as a C library.

GLPK uses the revised simplex method and the primal-dual interior point method for non-integer problems and the branch-and-bound algorithm together with Gomory's mixed integer cuts for (mixed) integer problems.

An independent project has also been developed that provides a Java-based interface to GLPK (via JNI). This allows JAVA applications to call out to GLPK and is relatively transparent.

External links

• GLPK official site
• GLPK for Debian GNU/Linux
• GLPK for Windows
• GLPK for Cygwin
• GLPK for Mac OS X
• GLPK Perl interface
• GLPK Java Interface
• GLPK Python interface
• GLPK Delphi Interface
• GLPK Common Lisp Interface
• Articles from IBM's developerWorks:
  • Introduction to linear optimization
  • Intermediate problems in linear programming
  • Advanced problems and elegant solutions

ca:GNU Linear Programming Kit de:GNU Linear Programming Kit it:Glpk