The NEOS Server offers MOSEK for the solution of optimization problems in
MOSEK is an extremely efficient implementation of an interior point
algorithm for the solution of linear and mixed integer programs and
convex nonlinear programs. Highlights of the MOSEK optimizer are:
- It employs the best interior-point technology.
- Basis identification for linear problems.
- A primal simplex optimizer is available for linear problems.
For further information about MOSEK,
Using the NEOS Server for MOSEK
The user must submit a model in
Examples of models in AMPL format can be found in the
The model is specified by a model file, and optionally,
a data file and a commands file.
If the command file is specified it must contain
the AMPL solve command.
The commands file can contain any AMPL command
options for MOSEK with, for example,
option mosek_options "outlev=2 MSK_DPAR_INTPNT_TOLPFEASNLO=1.0e-05";
Options include any of the parameters listed in The MOSEK optimization tools manual, see http://www.mosek.com.
Printing directed to standard out is returned
to the user with the output.
Enter the location of the ampl model (local file)
Enter the location of the ampl data file (local file)
Enter the location of the ampl commands file (local file)
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.