Solve optimization problems in COM/.NET Apps
Include refined procedures for resolving and performing sensitivity evaluation on uni and multiple dimensional, local or worldwide optimization problems which might or may not possess constraints; for your. NET plus COM Applications. Specialized Simplex Linear programming algorithm, which includes sensitivity analysis with regard to object functions coefficients or linear boundaries utilizing a duality or direct strategy.
This suite includes these features:
Local UniDimensional -18 Distinct Algorithms involving various Location and Bracketing Methods. Bracketing: Acceleration, Parabolic extrapolation; Locate: Parabolic interpolation,
Geradlinig, Brent, Cubic interpolation.
Worldwide UniDimensional - Accurate higher level algorithms for continuous plus derivable object functions.
Nearby MultiDimensional - General Features: Downhill simplex method associated with Nelder and Mead, Powells method, Derivable functions: Steepest descent, Fletcher-Reeves, Polak-Riviere, Fletcher-Powell, Broyden-Fletcher-Goldfarb-Shanno
Global Multidimensional -- Simulated annealing technique used to local algorithm.
Limited optimization - Linear: Rosens gradient projection algorithm
Geradlinig programming - Simplex formula, Duality, Sensitivity Analysis
This particular product also has these technology aspects:
2-in-1:. INTERNET and COM - 2 DLLs, Two API Documents, Two sets of Customer Examples all in one product. Offering a first class. NET and POSSUINDO product implementation.
Extensive Customer Examples - Multiple customer examples including Delphi, C# and VB. NET good examples
Compatible Containers - Delphi 3 - 8, Delphi 2005, Borlands C Contractor (incl. C Builder, Chemical BuilderX, C 2005), Workplace 97/2000/XP/2003.
|
WebCab Optimization for Delphi
Downloads
: 203
