package ocplib-simplex
A library implementing a simplex algorithm, in a functional style, for solving systems of linear inequalities and optimizing linear objective functions
Install
Dune Dependency
Authors
Maintainers
Sources
v0.5.tar.gz
sha256=5d76f55cc19c4ce212789ecb879d86b876e8930283463fc4f8ac1374ddfa6ef4
md5=8e0596c828b50527314001d4c6ca3123
doc/CHANGES.html
(!!! = may break code that uses previous versions)
version 0.5, November 15, 2022
- Reworking the library build system, now only relying on dune. The Makefile is now clearer and simpler to use.
- (!!!) Logs are handled by the
logs
library and debug is activated by this library. - (!!!) The
Rat2
module now abstract bounds as strict upper, strict lower or soft bounds instead of pairs of rationals.
version 0.4, August 22, 2017
- (!!!) Now, asserting bounds returns whether these bounds are trivially implied by those that are already known
- add a field nb_pivots in the environment to count the number of pivots that have been made so far.
verion 0.3, November 09, 2016
- bugfix in maximization
verion 0.2, August 24, 2016
- add support for linear optimization (!!!). An minimal example is given in tests/standalone_minimal_maximization.ml
- some bugfixes when assuming inconsistent bounds
- improve build and testing
first public 0.1, July 11, 2016
A functor called
Basic
provides three modules:Core
: provides some basic functions, and a functionempty
to create an empty environmentAssert
: exports two functionsvar
andpolys
to assert bounds on variables and polynomials, respectivelySolve
: exports a functionsolve
that tries to find a solution for the constrains
- two flags can be set when creating an empty environment to activate debug mode and some invariants verification
- implementation is fully functional, incremental and backtrackable
- linear optimization is not supported yet
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>