Search Results for "tora for linear programming"

This Decision Support System is designed to help the decision-maker in situations where he wishes to rank several actions (alternatives, proposals, strategies, projects, etc.) defined on several criteria. The performance of these actions on any criterion can be known with a certain level of uncertainty in the sense that they are characterised by a probability distribution on the variation interval of the criterion. In general terms, the DSS provides a ranking of all the actions which are...

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

This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network.

F2what is an open source project to translate algorithmic fortran to a variety of languages (java, dotnet and VBA so far). It offers a Fortran77 parser with code transformations, variable disambiguation, and modular output to other programming languages. It also offers already translated versions of Lapack and quadprog to Java, .Net and VBA, to give access to SVD, LU, QR, Cholesky, eigenvalue decomposition, linear system solving and QP optimization in those three languages.

LinProg.NET is a framework for mathematical programming, supporting linear, integer, boolean and quadratic programming.

The Auckland Layout Model is a platform-independent 2D layout technology for arranging the controls in a GUI. The model supports the specification of constraints based on linear algebra, and an optimal layout is calculated using linear programming.

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G