An ocaml implementation of variants of the simplex and branch&bound algorithms for satisfiability.
  • OCaml 99.1%
  • Makefile 0.9%
Find a file
2014-09-10 16:43:02 +02:00
.gitignore Bounds can be added on a not-yet defined variable. 2014-05-13 16:33:18 +02:00
.merlin Modifs done. Not tested yet. 2014-09-05 16:09:06 +02:00
_tags Added empty _tags 2014-09-05 12:18:23 +02:00
lib.odocl First commit 2014-05-13 11:21:28 +02:00
LICENSE Added license file 2014-07-11 15:20:40 +02:00
main.ml Fixed a bug when strict inequalities where not used 2014-09-10 16:28:39 +02:00
Makefile Fixed a bug when copying an empty matrix 2014-09-10 00:13:18 +02:00
printBox.ml Forgot to add new module in previous commit 2014-07-11 11:20:00 +02:00
printBox.mli Forgot to add new module in previous commit 2014-07-11 11:20:00 +02:00
README Added 'make lib'. 2014-05-14 14:24:18 +02:00
simplex.ml Fix for the solving of the epsilon-value 2014-09-10 16:43:02 +02:00
simplex.mli Fixed a bug when copying an empty matrix 2014-09-10 00:13:18 +02:00

OCAML-SIMPLEX
*************

OCaml module that provides a persistent implementation of a variant of the simplex algorithm to check
for the satisfiability of a given system of linear equations/inequalities.

Dependencies
------------

Requires the following in order to compile :
- zarith
- ocamlbuild
- ocamlfind

Build
-----

'make' will compile the simplex module and the main executable to allow for some tests.
'make lib' will compile the simplex library (can be found after in _build/simplex.cmx[a]).
'make doc' will compile the documentation generated by ocamldoc, which can be then found in
lib.docdir/index.html.

Tests
-----

The main.ml file defines functions to generate random linear systems and then try and solve them.