11.8 The Solution File Format¶
MOSEK can output solutions to a text file:
basis solution file (extension
.bas
) if the problem is optimized using the simplex optimizer or basis identification is performed,interior solution file (extension
.sol
) if a problem is optimized using the interior-point optimizer and no basis identification is required,integer solution file (extension
.int
) if the problem is solved with the mixed-integer optimizer.
All solution files have the format:
NAME : <problem name>
PROBLEM STATUS : <status of the problem>
SOLUTION STATUS : <status of the solution>
OBJECTIVE NAME : <name of the objective function>
PRIMAL OBJECTIVE : <primal objective value corresponding to the solution>
DUAL OBJECTIVE : <dual objective value corresponding to the solution>
CONSTRAINTS
INDEX NAME AT ACTIVITY LOWER LIMIT UPPER LIMIT DUAL LOWER DUAL UPPER
? <name> ?? <a value> <a value> <a value> <a value> <a value>
AFFINE CONIC CONSTRAINTS
INDEX NAME I ACTIVITY DUAL
? <name> <a value> <a value> <a value>
VARIABLES
INDEX NAME AT ACTIVITY LOWER LIMIT UPPER LIMIT DUAL LOWER DUAL UPPER [CONIC DUAL]
? <name> ?? <a value> <a value> <a value> <a value> <a value> [<a value>]
SYMMETRIC MATRIX VARIABLES
INDEX NAME I J PRIMAL DUAL
? <name> <a value> <a value> <a value> <a value>
The fields ?
, ??
and <>
will be filled with problem and solution specific information as described below. The solution contains sections corresponding to parts of the input. Empty sections may be omitted and fields in []
are optional, depending on what type of problem is solved.
HEADER
In this section, first the name of the problem is listed and afterwards the problem and solution status are shown. Next the primal and dual objective values are displayed.
CONSTRAINTS
INDEX
: A sequential index assigned to the constraint by MOSEKNAME
: The name of the constraint assigned by the user or autogenerated.AT
: The status keybkc
of the constraint as in Table 11.4.ACTIVITY
: the activityxc
of the constraint expression.LOWER LIMIT
: the lower boundblc
of the constraint.UPPER LIMIT
: the upper boundbuc
of the constraint.DUAL LOWER
: the dual multiplierslc
corresponding to the lower limit on the constraint.DUAL UPPER
: the dual multipliersuc
corresponding to the upper limit on the constraint.
AFFINE CONIC CONSTRAINTS
INDEX
: A sequential index assigned to the affine expressions by MOSEKNAME
: The name of the affine conic constraint assigned by the user or autogenerated.I
: The sequential index of the affine expression in the affine conic constraint.ACTIVITY
: the activity of theI
-th affine expression in the affine conic constraint.DUAL
: the dual multiplierdoty
for theI
-th entry in the affine conic constraint.
VARIABLES
INDEX
: A sequential index assigned to the variable by MOSEKNAME
: The name of the variable assigned by the user or autogenerated.AT
: The status keybkx
of the variable as in Table 11.4.ACTIVITY
: the valuexx
of the variable.LOWER LIMIT
: the lower boundblx
of the variable.UPPER LIMIT
: the upper boundbux
of the variable.DUAL LOWER
: the dual multiplierslx
corresponding to the lower limit on the variable.DUAL UPPER
: the dual multipliersux
corresponding to the upper limit on the variable.CONIC DUAL
: the dual multiplierskx
corresponding to a conic variable (deprecated).
SYMMETRIC MATRIX VARIABLES
INDEX
: A sequential index assigned to each symmetric matrix entry by MOSEKNAME
: The name of the symmetric matrix variable assigned by the user or autogenerated.I
: The row index in the symmetric matrix variable.J
: The column index in the symmetric matrix variable.PRIMAL
: the value ofbarx
for the (I
,J
)-th entry in the symmetric matrix variable.DUAL
: the dual multiplierbars
for the (I
,J
)-th entry in the symmetric matrix variable.
Status key |
Interpretation |
---|---|
|
Unknown status |
|
Is basic |
|
Is superbasic |
|
Is at the lower limit (bound) |
|
Is at the upper limit (bound) |
|
Lower limit is identical to upper limit |
|
Is infeasible i.e. the lower limit is greater than the upper limit. |
Example.
Below is an example of a solution file.