The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

A.2. CLASS TASK 277
last : int
Value of the last index+1 in the slice, e.g. if xx[5, . . . , 9] is required last should be 10.
solitem : solitem
Which part of the solution is required.
values : double[]
The values in the required sequence are stored sequentially in values starting at values[0].
whichsol : soltype
Selects a solution.
Description:
Obtains a slice of the solution.
Consider the case of linear programming. The primal problem is given by
and the corresponding dual problem is
minimize
c T x + c f
subject to l c ≤ Ax ≤ u c ,
l x ≤ x ≤ u x .
maximize (l c ) T s c l − (u c ) T s c u
+ (l x ) T s x l − (u x ) T s x u + c f
subject to A T y + s x l − s x u = c,
− y + s c l − s c u = 0,
s c l , s c u, s x l , s x u ≥ 0.
The solitem argument determines which part of the solution is returned:
solitem.xx:
The variable values return x.
solitem.y:
The variable values return y.
solitem.slc:
The variable values return s c l .
solitem.suc:
The variable values return s c u.
solitem.slx:
The variable values return s x l .
solitem.sux:
The variable values return s x u.
A conic optimization problem has the same primal variables as in the linear case. Recall that
the dual of a conic optimization problem is given by: