limp: representation of Integer Linear Programs

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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]

Properties

Versions0.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, 0.3.2.3
Change logchangelog
Dependenciesbase (>=4.9 && <5), containers (>=0.5 && <0.7) [details]
LicenseMIT
AuthorAmos Robinson
Maintaineramos.robinson@gmail.com
CategoryNumeric
Home pagehttps://github.com/amosr/limp
Source repositoryhead: git clone git://github.com/amosr/limp.git
UploadedMon Nov 12 21:50:47 UTC 2018 by amosrobinson

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


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.