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.
Publisher description
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.
Related Programs
WebCab Optimization for Delphi 2.6
Solve local & global optimization problems.
WebCab Optimization (J2EE Edition) 2.6
EJB suite for solving optimization problems.
WebCab Optimization (J2SE Edition) 2.6
Java API for solving optimization problems.
Maxima and Minima 1.00
Finds extrema of multivariable functions
GIPALS - Linear Programming Environment 3.3
Linear programming environment.
