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

274 APPENDIX A. API REFERENCE
maxdbi : double
Maximum infeasibility in bounds on dual variables.
max{0, max i∈{0,...,n−1} −(s x l ) i , max i∈{0,...,n−1} −(s x u) i , max i∈{0,...,m−1} −(s c l ) i , max i∈{0,...,m−1} −(s c u) i }
maxdcni : double
Maximum infeasibility in the dual conic constraints.
maxdeqi : double
Maximum infeasibility in the dual equality constraints.
max { ∥ ∥A T y + s x l − s x u − c ∥ ∞ , ‖ − y + s c l − s c }
u‖ ∞
maxinti : double
Maximum infeasibility in integer constraints.
max i∈{0,...,n−1} (min(x i − ⌊x i ⌋, ⌈x i ⌉ − x i )).
maxpbi : double
Maximum infeasibility in primal bounds on variables.
max {0, max i∈1,...,n−1 (x i − u x i ), max i∈1,...,n−1 (li x − x i ), max i∈1,...,n−1 (x c i − u c i), max i∈1,...,n−1 (li c − x c i)}
maxpcni : double
Maximum infeasibility in the primal conic constraints.
maxpeqi : double
Maximum infeasibility in primal equality constraints.
‖Ax − x c ‖ ∞
primalobj : double
Value of the primal objective.
c T x + c f
prosta : prosta
Problem status.
solsta : solsta
Solution status.
whichsol : soltype
Selects a solution.
Description:
Deprecated. Use Task.getsolutioninfo instead.