دانلود Mosek v7.1.0.42 x86/x64 نرم افزار حل و بهینه سازی مسائل ریاضی

Problem types MOSEK can solve
- Linear
- Conic quadratic
- Semidefinite (Positive semidefinite matrix variables)
- Quadratic and quadratically constrained
- General convex nonlinear
- Mixed integer linear, conic and quadratic

Technical highlights
- Problem size limited only by the available memory.
- Interior-point optimizer with basis identification.
- Primal and dual simplex optimizers for linear programming.
- Highly efficient presolver for reducing problem size before optimization.
- Network-simplex for problems with network flow structure.
- Branch&bound&cut algorithm for mixed integer problems.

Strengths of MOSEK
The strong point of MOSEK is its state-of-the-art interior-point optimizer for continous linear, quadratic and conic problems.
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. The default mixed integer optimizer is parallelized and is run-to-run deterministic.
Reads and writes industry standard formats such as the MPS and LP formats. Includes tools for infeasibility diagnosis and repair. Sensitivity analysis for linear problems.
Deployment

The MOSEK optimizer includes several interfaces.
- Developer APIs
- An API provides homogeneous full access to all solvers from several programming languages: C/C++ Java .NET Python Matlab
- MATLAB optimization toolbox