|
NMath Analysis 2.0
|
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
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