sponsored links
WebCab Optimization for .NE
Solving local or global optimization problems. NET class library.
Description
". Local or global optimization problems to solve NET class library."
zagruzit.com Editor: Solving and uni and multi-local or global optimization problems-dimensional sensitivity analysis may be restrictions on what to do or be linear for the refinement procedures. Linear programming simplex algorithm, duality-based expert algorithms and sensitivity analysis is included along with a framework WRT boundaries (duality, or direct approach), or object function coefficients.
Product Details
This package features the following:
Local uni-dimensional optimization include: Fast `low level 'algorithms (in steps and algorithms), the correct` high level' algorithms, global uni-dimensional optimization.
global self-dimensional optimization
algorithms - a technique to optimize the large-scale problems, especially those attracted significant attention as suitable where a desired global extreme poverty among many local tip
derivable functions with linear constraints for the restricted optimization
Rosen's gradient projection algorithm - Kuhn-Tucker uses as a termination criteria.
Linear programming - here the linear functions and linear constraints are
Simplex algorithm - Kuenzi, simplex algorithm for linear programming Tszchach and Zehnder implementation
Duality - Construction and primal linear programming problem for a specific couple to resolve the issue.
Sensitivity Analysis - Study how the location and the extreme values of object function and linear constraints under perturbations in parallel with the shift changes. Sensitivity analysis limits most applications can efficiently be carried out with duality techniques.
Sensitivity Analysis - Stability of the value and end position
<Br> General Framework - Perform a sensitivity analysis for any optimization problem / algorithm combination. object function, constraints, and / or algorithm
Flexibility - Perform a sensitivity analysis. now. You can free download WebCab Optimization for NET 2.6.
Rosen's gradient projection algorithm - Kuhn-Tucker uses as a termination criteria.
Linear programming - here the linear functions and linear constraints are
Simplex algorithm - Kuenzi, simplex algorithm for linear programming Tszchach and Zehnder implementation
Duality - Construction and primal linear programming problem for a specific couple to resolve the issue.
Sensitivity Analysis - Study how the location and the extreme values of object function and linear constraints under perturbations in parallel with the shift changes. Sensitivity analysis limits most applications can efficiently be carried out with duality techniques.
Sensitivity Analysis - Stability of the value and end position
<Br> General Framework - Perform a sensitivity analysis for any optimization problem / algorithm combination. object function, constraints, and / or algorithm
Flexibility - Perform a sensitivity analysis. now. You can free download WebCab Optimization for NET 2.6.
sponsored links
Visitor rates
9 Star
31
Member rates
9 Star
14
Ortalama oy:
3,8