GIPALS32 - Linear Programming Library 3.5
linear programming library that incorporates the power of linear programming solver and simplicity of integration to any software tools like Ms Visual C++, Ms Visual C# .Net, Ms Visual Basic, Borland Delphi and other that support a DLL import. The maximum number of constraints and variables is unlimited. The linear program solver is based on Interior-Point method (Mehrotra predictor-corrector algorithm) and optimized for large sparse linear programs |

GIPALS32 - Linear Programming Library 3.0

linear programming library that incorporates the power of linear programming solver and simplicity of integration to any software tools like Ms Visual C++, Ms Visual C# .Net, Ms Visual Basic, Borland Delphi and other that support a DLL import. The maximum number of constraints and variables is unlimited. The linear program solver is based on Interior-Point method (Mehrotra predictor-corrector algorithm) and optimized for large sparse linear programs

optimization, linear programming library, linear program, library, matrix, gipals32, primal dual, linear programming, interior point, constrained optimization, constraint

GIPALS - Linear Programming Environment 3.3

linear programs with tens and hundreds of thousand variables and constraints. GIPALS can import linear programs from Mathematical Programming System (MPS) data format that is an industry standard for the description of a variety of linear programs. Any linear program specified in GIPALS` user interface could be exported to MPS format. The solution of the linear programs can be saved as CSV (comma-delimited spreadsheet), Tab-delimited or HTML file

optimization, predictor corrector, linear program, matrix, primal dual, gipals, linear programming, interior point, constrained optimization, sparse matrix, constraint, large scale

NMath Analysis 2.0

linear programming. Product features include classes for minimizing univariate functions using golden section search and Brent’s method, minimizing multivariate functions using the downhill simplex method, Powell’s direction set method, the conjugate gradient method, and the variable metric (or quasi-Newton) method, simulated annealing, linear programming using the simplex method, least squares polynomial fitting, finding roots of univariate functions

basic, optimization, marquardt, function, linear, trust, nmath, levenberg, programming, root, minimization, visual, centerspace

D Programming Language Library DWin 0.36

"D programming language" library DWin is a library for the "D Programming language", Packages included in DWin cover such areas as : Windows COM client programming, Windows Registry module, PCRE Regular Expression, Send Email, Loads an ini style file(muliti line supported), BigInt, Create Windows shortcut and more... get "D programming language" library DWin : http://dwin.chinese-blog.org

WebCab Optimization (J2EE Edition) 2.6

linear constraints; linear programming - here the functions are linear and the constraints are linear; sensitivity Analysis - Stability of the value and location of the extremum This product also contains the following feature: GUI Bundle - we bundle a suite of graphical user interface JavaBean components allowing the developer to plug-in a wide range of GUI functionality (including charts/graphs) into their client applications. EAR Files - we provide

combination, minimum, maximum, optimization, websphere, dimensional, local, local global, problem algorithm, j2ee, global, java, minima

WebCab Optimization (J2SE Edition) 2.6

Refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have linear constraints. Specialized Linear programming algorithms based on the Simplex Algorithm and duality are included along with a framework for sensitivity analysis w.r.t. boundaries (duality, or direct approach), or object function coefficients.

optimization, minima, java, class libraries, local global, maxima, linear programming, javabeans, j2se