NEOS Server Home

NEOS Interfaces to MOSEK

WWW Form & Sample Submissions


The NEOS Server offers MOSEK for the solution of mixed integer linear programming (MILP) problems in MPS format.

MOSEK is designed to solve large-scale optimization problems; the technical strengths of MOSEK are its state-of-the-art interior-point optimizer and its branch-and-bound-and-cut algorithm for MILPs. For more information, visit the MOSEK website.

Using the NEOS Server with MOSEK

To solve an MILP problem in MPS format, you only need to submit the MPS file. The MPS file may be submitted in gzipped or zipped format, and NEOS will automatically uncompress it.

Web Submission Form
MPS file
Enter the path to the MPS file
Parameter file
Enter the path to the parameter file
Return .int file
Check the box to include the int solution file as part of the results
Additional Settings
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5 minutes
E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.