E-mail this page
Our Webinars
MOSEK Solver for Linear and Mixed Integer Programming
The MOSEK solver is a solver for Linear Programming (LP), Mixed Integer Programming (MIP), Quadratic Programming (QP/QCP/MIQP/MIQCP) and convex Nonlinear Programming problems. MOSEK's interior point algorithm is well suited for solving large-scale linear programs and quadratic programs. It is also capable of efficiently solving smooth convex nonlinear Optimization problems.
Download a free license to use MOSEK as the Linear and Mixed Integer Programming Solver in AIMMS
MOSEK Linear Programming
MOSEK Basic offers various algorithms for solving Linear Programming problems: you can choose between the primal or dual simplex algorithm, the interior point algorithm and the network algorithm. The interior-point optimizer is capable of using multiple CPUs or cores. The parallel optimizer is included within MOSEK at no extra charge.
MOSEK Mixed Integer Programming
MOSEK Full can also solve Mixed Integer Programming problems. The MOSEK branch-and-bound algorithm for solving Mixed Integer Programming problems uses modern features like cutting planes and heuristics to find integer solutions.
MOSEK Quadratic Programming and Convex Nonlinear Programming
MOSEK Basic can be used to solve Quadratic Programming (QP) problems which are problems with linear constraints and a quadratic objective function. It can also handle problems that have quadratic constraints: Quadratically Constrained Programming (QCP). MOSEK Full can also handle the variants with integer variables: Mixed Integer Quadratic Programming (MIQP) problems and Mixed Integer Quadratically Constrained Programming (MIQCP) problems. MOSEK Basic can handle convex Nonlinear Programming problems.
About MOSEK
MOSEK is developed and supported by MOSEK ApS. MOSEK is a registered trademark of MOSEK ApS.
Website: 
http://www.mosek.com
MOSEK Supported Versions
AIMMS supports MOSEK 6.
Download a free license to use MOSEK as the Linear and Mixed Integer Programming Solver in AIMMS
