linear p

WebCab Optimization for NET

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. ...
WebCab Components :: optimization linear programming NET XML Web service Class Libraries C# VB NET maxima minima local global :: WebCab Optimization for NET

WebCab Optimization J2EE Edition

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. ...
WebCab Components :: optimization linear programming EJB J2EE JSP Java maxima minima local global :: WebLogic WebSphere :: maximum :: minimum :: optimization problem/algorithm comb :: WebCab Optimization (J2EE Edition)