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