Google

Software Info

Thursday, June 7, 2007

Linear Programming Solver Into Applications

KITCHENER, Canada (EWORLDWIRE)June 8, 2007 - Optimalon Software has released a new version of its library, Gipals32, offering a simple and reliable way to solve any kind of linear programming task. The library can easily find a solution or state a solution doesn't exist for any kind of linear program with an unlimited number of variables and constraints.
Gipals32 is a Windows-based library, and it can be easily integrated into existing or new applications for Windows written on C++, VB, VC++, C#, Delphi and other programming languages. The library provides a simple application programming interface (API) that allows specifying or modifying the linear programming tasks using few functions and tunes the optimization engine according to user requirements.
The main features of Gipals32 are:
. Robust Interior-Point method for fast and reliable solution.
. Unlimited number of variables and constraints.
. Flexible preprocessing to reduce task size and optimization time.
. Constraint matrix scaling to improve numeric stability.
. Iterative refinement to improve solution quality and reduce the number of iterations.
. High order Gondzio correction to improve solution quality.
. Special method for handling dense columns constraint matrix.
. Support the industrial standard format of linear programs.
. Simple programming interface.
Linear programming is widely used in logistics, transportation, oil refinery, financial and many other practical applications to maximize profit or minimize costs. The typical example of a linear programming task is a transport problem, which requires finding a plan that minimizes the transportation cost of goods from a few warehouses to several clients.
Gipals32 is available on a try-before-buy basis so anyone can download it for free and test it for a 30-day trial period. More information about the library is available at Optimalon Software Web site,
'http://www.optimalon.com/product_gipals32.htm'.

Add to Technorati Favorites

0 Comments:

Post a Comment

<< Home