With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
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
Timeseries handling, and solving of large-scale economic models
Gekko Timeseries Software is a free time-series oriented software package for timeseries handling, and solving and analyzing large-scale economic models. Since 2009, Gekko is being used by Danish ministeries, banks, interest groups and universities, for the simulation of economic and energy-related models. The software runs under Windows (.NET), and is open source (GNU GPL)
...Specifically, Wolfgang supports full PNML conform editing functionality of Place-Transition Nets (P/T-Nets) and Colored Petri Nets (CPN) as they are defined in the SEPIA package. Its simple and easy to use interface allows to quickly create Petri nets from scratch, edit them graphically in many ways, store and even export them as PDFs. Use Wolfgang to smoothly create the Petri net you want!
A user guide and a documentation can be found under http://doku.telematik.uni-freiburg.de/wolfgang.
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