limp: representation of Integer Linear Programs

[ library, mit, numeric ] [ Propose Tags ]

This package provides two representations for linear programs: Numeric.Limp.Program, which is what I expect end-users to use, and Numeric.Limp.Canon, which is simpler, but would be less nice for writing linear programs. You can convert programs from the Program representation to the Canon representation using Numeric.Limp.Canon.Convert, and then pretty-print the program using Numeric.Limp.Canon.Pretty. There is a very simple branch-and-bound solver in Numeric.Limp.Solve.Branch.Simple, and a simplex solver for relaxed (real only) programs in Numeric.Limp.Solve.Simplex.Maps. See the limp-cbc package for a simple external solver.


[Skip to Readme]
Versions [RSS] [faq] 0.1.0.0, 0.3.0.0, 0.3.1.0, 0.3.2.0, 0.3.2.1, 0.3.2.2, 0.3.2.3
Change log changelog
Dependencies base (>=4.9 && <5), containers (>=0.5 && <0.7) [details]
License MIT
Author Amos Robinson
Maintainer amos.robinson@gmail.com
Category Numeric
Home page https://github.com/amosr/limp
Source repo head: git clone git://github.com/amosr/limp.git
Uploaded by amosrobinson at 2018-11-12T21:52:19Z
Distributions NixOS:0.3.2.3
Downloads 4542 total (32 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-11-12 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates


Readme for limp-0.3.2.3

[back to package description]

limp

This package provides two representations for linear programs: "Numeric.Limp.Program", which is what I expect end-users to use, and "Numeric.Limp.Canon", which is simpler, but would be less nice for writing linear programs. You can convert programs from the Program representation to the Canon representation using "Numeric.Limp.Canon.Convert", and then pretty-print the program using "Numeric.Limp.Canon.Pretty".

There is a very simple branch-and-bound solver in "Numeric.Limp.Solve.Branch.Simple", and a simplex solver for relaxed (real only) programs in "Numeric.Limp.Solve.Simplex.Maps". See the limp-cbc package for a simple external solver.