A open-source utility library for linear programming in Java with the simplex algorithm. Problems are of the type: min/max c*x st. Ax ❮= b x >= 0 The primal problem is solved using Gauss-Jordan elimination and the lexicographic rule for pivoting is used. Handles: - maximization and minimization problems - equality and inequality constraints - negative and positive constraint values. The library can be used by other ICY plugins or called as a standalone Java software for ...