Add refined procedures for solving uni and multi dimensional, local or global optimization problems to your .NET and COM Applications. Specialized Linear programming algorithm based on the Simplex Algorithm and duality, included. 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, and COM 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.
delph,
i .net,
com,
vb.net,
solve,
sensitivity,
analysis,
uni,
multi,
dimensional,
|
EJB collection containing refined procedures for solving sensitivity analysis on uni and multi dimensional, local or global optimization problems. Specialized Linear programming algorithms based on the Simplex Algorithm and duality, are included. 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,
linear programming,
ejb,
j2ee,
jsp,
java,
maxima,
minima,
local global,
weblogic,
|
|
|
