SuggestSoft.com

Linear Program

GIPALS - Linear Programming Environment 3.3

GIPALS - Linear Programming Environment 3.3: Linear programming environment for constrained optimization. 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






GIPALS32 - Linear Programming Library 3.5: Linear programming library for constrained optimization.
GIPALS32 - Linear Programming Library 3.5

linear programs by implementing the state-of-art algorithm to order the constraints matrix. The user can specify the linear program using a set of exported DLL functions. Also GIPALS32 provides an import of linear programs from Mathematical Programming System (MPS) data format that is an industry standard for the description of a variety of linear programs. Key features of GIPALS32: UNLIMITED linear program size; No external components or DLL are

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





GIPALS32 - Linear Programming Library 3.0: Linear programming library for constrained optimization.
GIPALS32 - Linear Programming Library 3.0

linear programs by implementing the state-of-art algorithm to order the constraints matrix. The user can specify the linear program using a set of exported DLL functions. Also GIPALS32 provides an import of linear programs from Mathematical Programming System (MPS) data format that is an industry standard for the description of a variety of linear programs. Key features of GIPALS32: UNLIMITED linear program size; No external components or DLL are

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



WebCab Optimization (J2EE Edition) 2.6: Enterprise Java Component for solving local or global optimization problems.
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: Java class library for solving local or global optimization problems.
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



WebCab Optimization for .NET 2.6: Add optimization & L.P.  solver to .NET, COM and Web service Applications.
WebCab Optimization for .NET 2.6

Linear programming algorithm, including sensitivity analysis with respect to object functions coefficients or linear boundaries using a duality or direct approach. This suite includes the following features: Local UniDimensional -18 Distinct Algorithms involving different Location and Bracketing Algorithms. Bracketing: Acceleration, Parabolic extrapolation; Locate: Parabolic interpolation, Linear, Brent, Cubic interpolation. Global UniDimensional

web service, maxima, optimization, linear programming, minima, vb net, class libraries, local global



NMath Analysis 2.0: .NET function minimization, root finding, and linear programming class library.
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


More Results: 1  2  3  4  5  6  

World IT News