Search Results for "linear program solver tora"

DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in...

Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming

TU Calc is a modular tool that aims to gather numerical methods for solution of mathematical problems. Interacting with the user through a GUI that is analogous to the windows desktop.

mathSuite is a very powerful Mathematical Suite which deals principally with complex algebric and geometric operations. It is powered by the fabulous ExprEval C Parser. The main purpose of this project is fast math-oriented algorithm virtualization, with an optimized direct text interface. Also it gives you a very powerful and fast Calculus Environment which let you handle easily interchangeable variable lists, matrices, LOGS and Settings Layouts with optimized Items Lists Managing Engine....

Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming