Editing GNU Linear Programming Kit

{{Infobox software
| name                   = GNU Linear Programming Kit
| logo                   =
| screenshot             =
| caption                =
| author                 = Andrew O. Makhorin
| developer              = [[GNU Project]]
| released               =
| latest release version = {{wikidata|property|edit|reference|P348}}
| latest release date    = {{start date and age|{{wikidata|qualifier|P348|P577}}}}
| latest preview version =
| latest preview date    =
| programming language   = [[C (programming language)|C]]
| operating system       = [[Cross-platform]]
| language               = English
| genre                  =
| license                = [[GNU General Public License|GPLv3]]
| website                = {{URL|https://www.gnu.org/software/glpk/}}
}}

The '''GNU Linear Programming Kit''' ('''GLPK''') is a [[Software package (installation)|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 [[Function (computer programming)|callable]] [[library (computer science)|library]]. The package is part of the [[GNU Project]] and is released under the [[GNU General Public License]].

GLPK uses the [[Simplex algorithm#Implementation|revised simplex method]] and the primal-dual [[interior point method]] for [[Non-integer base of numeration|non-integer]] problems and the [[Branch and bound|branch-and-bound]] algorithm together with [[Cutting-plane method#Gomory.27s cut|Gomory's mixed integer cuts]] for (mixed) integer problems.

== History ==
GLPK was developed by Andrew O. Makhorin (Андрей Олегович Махорин) of the [[Moscow Aviation Institute]]. The first public release was in October 2000.
* Version 1.1.1 contained a [[Library (computing)|library]] for a revised primal and dual simplex algorithm.
* Version 2.0 introduced an [[implementation]] of the primal-dual [[Interior-point method|interior point method.]]
* Version 2.2 added branch and bound solving of mixed integer problems.
* Version 2.4 added a first implementation of the GLPK/L modeling language.
* Version 4.0 replaced GLPK/L by the GNU MathProg modeling language, which is a subset of the [[AMPL]] [[modeling language]].

== Interfaces and wrappers ==
Since version 4.0, GLPK problems can be modeled using '''[[GNU MathProg]]''' (GMPL), a subset of the [[AMPL]] modeling language used only by GLPK. However, GLPK is most commonly called from other programming languages. Wrappers exist for:

* [[Julia (programming language)|Julia]]<ref>{{Citation |title=GLPK.jl |date=2023-01-16 |url=https://github.com/jump-dev/GLPK.jl |publisher=JuMP-dev |access-date=2023-02-04}}</ref> and the [[JuMP]] modeling package<ref>{{Citation |title=jump-dev/JuMP.jl |date=2023-02-04 |url=https://github.com/jump-dev/JuMP.jl |publisher=JuMP-dev |access-date=2023-02-04}}</ref>
* [[Java (Sun)|Java]] (using [[OptimJ]])<ref>{{cite web |title=GLPK for Java – About |url=http://glpk-java.sourceforge.net}}</ref>

== Further reading ==
{{Wikibooks|GLPK}}
* {{cite book |author=Eiji Oki |title=Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management |year=2012 |publisher=CRC Press |isbn=978-1-4665-5264-7}} The book uses GLPK exclusively and contains numerous examples.

==References==
{{reflist}}

==External links==
{{Portal|Free and open-source software}}
* [https://www.gnu.org/software/glpk/ GLPK official site]
* [[wikibooks:GLPK|GLPK Wikibook]]

{{Mathematical optimization software}}

[[Category:GNU Project software|Linear Programming Kit]]
[[Category:Mathematical optimization software]]
[[Category:Free mathematics software]]
[[Category:Free software programmed in C]]
[[Category:Mathematics software for Linux]]