The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
256 APPENDIX A. API REFERENCE Description: Deprecated. Obtains the primal bound infeasibility. If acmode is accmode.con then pbi[i] = max(x c sub[i] − uc sub[i] , lc sub[i] − xc sub[i] , 0) for i = 0, . . . , len − 1 If acmode is accmode.var then pbi[i] = max(x sub[i] − u x sub[i] , lx sub[i] − x sub[i], 0) for i = 0, . . . , len − 1 A.2.105 Task.getpcni() Task.getpcni( whichsol, sub, pcni) Deprecated. Arguments pcni : double[] pcni[i] contains primal cone infeasibility for the cone with index sub[i]. sub : int[] Constraint indexes for which to calculate the equation infeasibility. whichsol : soltype Selects a solution. Description: Deprectaed. A.2.106 Task.getpeqi() Task.getpeqi( whichsol, sub, peqi, normalize) Deprecated. Arguments
A.2. CLASS TASK 257 normalize : int If non-zero, normalize with largest absolute value of the input data used to compute the individual infeasibility. peqi : double[] peqi[i] contains equation infeasibility of constraint sub[i]. sub : int[] Constraint indexes for which to calculate the equation infeasibility. whichsol : soltype Selects a solution. Description: Deprecated. Obtains the primal equation infeasibility. peqi[i] = ∣ ∣(Ax − x c ) sub[i] ∣ ∣ for i = 0, . . . , len − 1. A.2.107 Task.getprimalobj() primalobj = Task.getprimalobj(whichsol) Computes the primal objective value for the desired solution. Arguments primalobj : double Objective value corresponding to the primal solution. whichsol : soltype Selects a solution. Description: Computes the primal objective value for the desired solution. Note if the solution is an infeasibility certificate, then the fixed term in the objective is not included. A.2.108 Task.getprobtype() probtype = Task.getprobtype() Obtains the problem type.
- Page 227 and 228: A.2. CLASS TASK 205 Arguments which
- Page 229 and 230: A.2. CLASS TASK 207 See also • Ro
- Page 231 and 232: A.2. CLASS TASK 209 Description: Ap
- Page 233 and 234: A.2. CLASS TASK 211 Description: If
- Page 235 and 236: A.2. CLASS TASK 213 A.2.16 Task.com
- Page 237 and 238: A.2. CLASS TASK 215 subj : int[] In
- Page 239 and 240: A.2. CLASS TASK 217 firsti : int In
- Page 241 and 242: A.2. CLASS TASK 219 A.2.27 Task.get
- Page 243 and 244: A.2. CLASS TASK 221 valijkl : Descr
- 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: A.2. CLASS TASK 255 A.2.103 Task.ge
- 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 and 296: A.2. CLASS TASK 273 Arguments accmo
- Page 297 and 298: A.2. CLASS TASK 275 A.2.133 Task.ge
- 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
A.2. CLASS TASK 257<br />
normalize : int<br />
If non-zero, normalize with largest absolute value of the input data used to compute the<br />
individual infeasibility.<br />
peqi : double[]<br />
peqi[i] contains equation infeasibility of constraint sub[i].<br />
sub : int[]<br />
Constraint indexes for which to calculate the equation infeasibility.<br />
whichsol : soltype<br />
Selects a solution.<br />
Description:<br />
Deprecated.<br />
Obtains the primal equation infeasibility.<br />
peqi[i] = ∣ ∣(Ax − x c ) sub[i]<br />
∣ ∣ for i = 0, . . . , len − 1.<br />
A.2.107<br />
Task.getprimalobj()<br />
primalobj = Task.getprimalobj(whichsol)<br />
Computes the primal objective value for the desired solution.<br />
Arguments<br />
primalobj : double<br />
Objective value corresponding to the primal solution.<br />
whichsol : soltype<br />
Selects a solution.<br />
Description:<br />
Computes the primal objective value for the desired solution. Note if the solution is an infeasibility<br />
certificate, then the fixed term in the objective is not included.<br />
A.2.108<br />
Task.getprobtype()<br />
probtype = Task.getprobtype()<br />
Obtains the problem type.
Change language