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.

See also: minima, maxima, JSP, J2SE, Class Libraries, JavaBeans, Java, linear programming, optimization, local global

WebCab Optimization for .NET 2.6

Add refined procedures for solving and performing sensitivity analysis on uni and multi dimensional, local or global optimization problems which may or may not have constraints; to your .NET, COM and XML Web service Applications. Specialized Simplex Linear programming algorithm, including sensitivity analysis with respect to object functions coefficients or linear boundaries using a duality (i.e. Lagrangian) or direct approach.

See also: minima, maxima, VB.NET, .NET, C++, C#, Class Libraries, Web service, XML, COM, .NET, linear programming, optimization, local global

WebCab Optimization (J2EE 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.

See also: optimization problem/algorithm combination, minimum, maximum, WebSphere, WebLogic, local global, minima, maxima, Java, JSP, J2EE, EJB, linear programming, optimization, flexibility, dimensional, local, global, optimization