---
title: GNU Linear Programming Kit
slug: gnu-linear-programming-kit
qid: Q838189
snapshot: gnu-linear-programming-kit-096365-b7435688c4d313da
content_hash: b7435688c4d313da58ae74f2602239a3ebfa7a4376559aa878b7e4031975bdc5
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1333532283
tags: [23118434, 23603337, 23617827, 26898194, 31503861, 40211111, 65631130]
---

# GNU Linear Programming Kit

> [!note] Provenance
> Snapshot `gnu-linear-programming-kit-096365-b7435688c4d313da` · content root `b7435688c4d313da…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1333532283> · Licensed CC BY-SA 4.0

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. 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.

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. 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. ==References== ==External links== GLPK official site GLPK Wikibook
