Problem types MOSEK can solve:
    * Linear problems.
    * Conic quadratic problems.
    * Quadratic and quadratically constrained problems.
    * General convex nonlinear problems.
    * Mixed integer linear, conic and quadratic problems.

Technical highlights of MOSEK are:
    * Problem size is only limited by the available memory.
    * An interior-point optimizer with basis identification.
    * Both primal and dual simplex optimizers for linear programming.
    * Highly efficient presolve  for reducing problem size before optimization.
    * A special optimizer is available for problems with network flow structure.
    * For mixed integer problems MOSEK implements a branch & bound & cut algorithm.

Parallel capabilities:
    * The interior-point optimizer is capable of exploiting multiple CPUs/cores.
    * A concurrent optimizer is available that makes it possible to solve one problem with different optimizers simultaneously.

Other features of MOSEK:
    * Reads and writes industry standard formats such as MPS, LP and XML.
    * Includes tools for infeasibility diagnosis and repair.
    * Sensitivity analysis for linear problems.

6.0.0.93
    * Fixed a bug in the Python API array module that caused a segmantation fault under certain circumstances at 64 bit systems.

Language: English
OS: Windows XP/ Vista / Windows 7
Homepage: http://anonym.to/?http://www.mosek.com/





" target="_blank" rel="nofollow">http://hotfile.com/dl/81590834/43178d4/Mosek.Optimization.Tools.v6.0.0.93.Cracked-EAT.zip.html" target="_blank">Mosek.Optimization.Tools.v6.0.0.93.Cracked-EAT.zip (53.03 MB)