NEOS Server Home

NEOS Interfaces to MOSEK

Sample Submissions
WWW Form - Email - XML-RPC


The NEOS Server offers MOSEK for the solution of linear programming (LP) problems, mixed-integer linear programming (MILP) problems, nonlinearly constrained optimization problems, and second-order conic optimization (SOCP) problems. LP and MILP problems can be submitted to MOSEK on the NEOS server in MPS, LP, AMPL, or GAMS format. Nonlinearly-constrained problems can be submitted in GAMS or AMPL format. SOCPs can be submitted in GAMS or MPS format.

MOSEK is designed to solve large-scale optimization problems; the technical strength of MOSEK is its state-of-the-art interior-point optimizer and its branch-and-bound-and-cut algorithm for MILPs. MOSEK provides primal and dual simplex optimizers for LP problems. For more information, visit the MOSEK website.

MOSEK was developed by
C/O Symbion Science Park
Fruebjergvej 3, Box 16
2100 Copenhagen 0, Denmark

Using the NEOS Server for MOSEK/LP

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

Note: Only LPs and MILPs can be submitted in LP format.
Web Submission Form
LP file
Enter the location of the LP file
Parameter file
Enter the path to the parameter file
Return .sol file
Return .int file
Return .bas file
Additional Settings

E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.