The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
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.
A.2. CLASS TASK 275 A.2.133 Task.getsolutioninfo() pobj,pviolcon,pviolvar,pviolbarvar,pviolcone,pviolitg,dobj,dviolcon,dviolvar,dviolbarvar,dviolcones = Task.getsolutioninfo(w Obtains information about of a solution. Arguments dobj : double Dual objective value as computed as computed by Task.getdualobj. dviolbarvar : double Maximal violation of the dual solution associated with the ¯s variable as computed by as computed by Task.getdviolbarvar. dviolcon : double Maximal violation of the dual solution associated with the x c variable as computed by as computed by Task.getdviolcon. dviolcones : double Maximal violation of the dual solution associated with the dual conic constraints as computed by Task.getdviolcones. dviolvar : double Maximal violation of the dual solution associated with the x variable as computed by as computed by Task.getdviolvar. pobj : double The primal objective value as computed by Task.getprimalobj. pviolbarvar : double Maximal primal violation of solution for the ¯X variables where the violations are computed by Task.getpviolbarvar. pviolcon : double Maximal primal violation of the solution associated with the x c variables where the violations are computed by Task.getpviolcon. pviolcone : double Maximal primal violation of solution for the conic constraints where the violations are computed by Task.getpviolcones. pviolitg : double Maximal violation in the integer constraints. The violation for an integer constrained variable x j is given by min(x j − ⌊x j ⌋, ⌈x j ⌉ − x j ). This number is always zero for the interior-point and the basic solutions.
- Page 245 and 246: A.2. CLASS TASK 223 A.2.33 Task.get
- Page 247 and 248: A.2. CLASS TASK 225 idx : long Inde
- Page 249 and 250: A.2. CLASS TASK 227 A.2.41 Task.get
- Page 251 and 252: A.2. CLASS TASK 229 i : int Index o
- Page 253 and 254: A.2. CLASS TASK 231 A.2.49 Task.get
- Page 255 and 256: A.2. CLASS TASK 233 conetype : cone
- Page 257 and 258: A.2. CLASS TASK 235 Description: Ob
- Page 259 and 260: A.2. CLASS TASK 237 sub : int[] Ind
- Page 261 and 262: A.2. CLASS TASK 239 A.2.64 Task.get
- Page 263 and 264: A.2. CLASS TASK 241 Computes the vi
- Page 265 and 266: A.2. CLASS TASK 243 A.2.71 Task.get
- Page 267 and 268: A.2. CLASS TASK 245 A.2.75 Task.get
- Page 269 and 270: A.2. CLASS TASK 247 A.2.80 Task.get
- Page 271 and 272: A.2. CLASS TASK 249 A.2.86 Task.get
- Page 273 and 274: A.2. CLASS TASK 251 A.2.92 Task.get
- Page 275 and 276: A.2. CLASS TASK 253 k : int Index o
- Page 277 and 278: A.2. CLASS TASK 255 A.2.103 Task.ge
- Page 279 and 280: A.2. CLASS TASK 257 normalize : int
- Page 281 and 282: A.2. CLASS TASK 259 Description: Le
- Page 283 and 284: A.2. CLASS TASK 261 max(l x j τ
- Page 285 and 286: A.2. CLASS TASK 263 A.2.117 Task.ge
- Page 287 and 288: A.2. CLASS TASK 265 last : int Last
- Page 289 and 290: A.2. CLASS TASK 267 A.2.124 Task.ge
- Page 291 and 292: A.2. CLASS TASK 269 Arguments snx :
- Page 293 and 294: A.2. CLASS TASK 271 slc : double[]
- Page 295: A.2. CLASS TASK 273 Arguments accmo
- Page 299 and 300: A.2. CLASS TASK 277 last : int Valu
- Page 301 and 302: A.2. CLASS TASK 279 subi : int[] Ro
- Page 303 and 304: A.2. CLASS TASK 281 Description: Ob
- Page 305 and 306: A.2. CLASS TASK 283 Arguments taskn
- Page 307 and 308: A.2. CLASS TASK 285 A.2.148 Task.ge
- Page 309 and 310: A.2. CLASS TASK 287 vartype : varia
- Page 311 and 312: A.2. CLASS TASK 289 whichsol : solt
- Page 313 and 314: A.2. CLASS TASK 291 Description: Ob
- Page 315 and 316: A.2. CLASS TASK 293 A.2.162 Task.is
- Page 317 and 318: A.2. CLASS TASK 295 whichstream : s
- Page 319 and 320: A.2. CLASS TASK 297 A.2.170 Task.pr
- Page 321 and 322: A.2. CLASS TASK 299 markj : mark Th
- Page 323 and 324: A.2. CLASS TASK 301 Prints a part o
- Page 325 and 326: A.2. CLASS TASK 303 A.2.175 Task.pu
- Page 327 and 328: A.2. CLASS TASK 305 j : int Index o
- Page 329 and 330: A.2. CLASS TASK 307 A.2.180 Task.pu
- Page 331 and 332: A.2. CLASS TASK 309 Description: Th
- Page 333 and 334: A.2. CLASS TASK 311 A.2.186 Task.pu
- Page 335 and 336: A.2. CLASS TASK 313 Changes the bou
- Page 337 and 338: A.2. CLASS TASK 315 Modifies one li
- Page 339 and 340: A.2. CLASS TASK 317 bkc : boundkey
- Page 341 and 342: A.2. CLASS TASK 319 Arguments j : i
- Page 343 and 344: A.2. CLASS TASK 321 parvalue : int
- Page 345 and 346: A.2. CLASS TASK 323 A.2.207 Task.pu
A.2. CLASS TASK 275<br />
A.2.133<br />
Task.getsolutioninfo()<br />
pobj,pviolcon,pviolvar,pviolbarvar,pviolcone,pviolitg,dobj,dviolcon,dviolvar,dviolbarvar,dviolcones = Task.getsolutioninfo(w<br />
Obtains information about of a solution.<br />
Arguments<br />
dobj : double<br />
Dual objective value as computed as computed by Task.getdualobj.<br />
dviolbarvar : double<br />
Maximal violation of the dual solution associated with the ¯s variable as computed by as<br />
computed by Task.getdviolbarvar.<br />
dviolcon : double<br />
Maximal violation of the dual solution associated with the x c variable as computed by as<br />
computed by Task.getdviolcon.<br />
dviolcones : double<br />
Maximal violation of the dual solution associated with the dual conic constraints as computed<br />
by Task.getdviolcones.<br />
dviolvar : double<br />
Maximal violation of the dual solution associated with the x variable as computed by as<br />
computed by Task.getdviolvar.<br />
pobj : double<br />
<strong>The</strong> primal objective value as computed by Task.getprimalobj.<br />
pviolbarvar : double<br />
Maximal primal violation of solution for the ¯X variables where the violations are computed<br />
by Task.getpviolbarvar.<br />
pviolcon : double<br />
Maximal primal violation of the solution associated with the x c variables where the violations<br />
are computed by Task.getpviolcon.<br />
pviolcone : double<br />
Maximal primal violation of solution for the conic constraints where the violations are<br />
computed by Task.getpviolcones.<br />
pviolitg : double<br />
Maximal violation in the integer constraints. <strong>The</strong> violation for an integer constrained variable<br />
x j is given by<br />
min(x j − ⌊x j ⌋, ⌈x j ⌉ − x j ).<br />
This number is always zero for the interior-point and the basic solutions.
Change language