The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
262 APPENDIX A. API REFERENCE Arguments numqonz : int Number of non-zero elements in the quadratic objective terms. qosubi : int[] Row subscripts for quadratic objective coefficients. qosubj : int[] Column subscripts for quadratic objective coefficients. qoval : Description: double[] Quadratic objective coefficient values. Obtains the quadratic terms in the objective. The required quadratic terms are stored sequentially in qosubi, qosubj, and qoval. A.2.116 Task.getqobj64() numqonz = Task.getqobj64( qosubi, qosubj, qoval) Obtains all the quadratic terms in the objective. Arguments numqonz : long Number of non-zero elements in the quadratic objective terms. qosubi : int[] Row subscripts for quadratic objective coefficients. qosubj : int[] Column subscripts for quadratic objective coefficients. qoval : Description: double[] Quadratic objective coefficient values. Obtains the quadratic terms in the objective. The required quadratic terms are stored sequentially in qosubi, qosubj, and qoval.
A.2. CLASS TASK 263 A.2.117 Task.getqobjij() qoij = Task.getqobjij( i, j) Obtains one coefficient from the quadratic term of the objective Arguments i : int Row index of the coefficient. j : int Column index of coefficient. qoij : double The required coefficient. Description: Obtains one coefficient q o ij in the quadratic term of the objective. A.2.118 Task.getreducedcosts() Task.getreducedcosts( whichsol, first, last, redcosts) Obtains the difference of (slx-sux) for a sequence of variables. Arguments first : int See formula (A.1) for the definition. last : int See formula (A.1) for the definition. redcosts : double[] The reduced costs in the required sequence of variables are stored sequentially in redcosts starting at redcosts[0]. whichsol : soltype Selects a solution.
- 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 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: A.2. CLASS TASK 261 max(l x j τ
- 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
- 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
A.2. CLASS TASK 263<br />
A.2.117<br />
Task.getqobjij()<br />
qoij = Task.getqobjij(<br />
i,<br />
j)<br />
Obtains one coefficient from the quadratic term of the objective<br />
Arguments<br />
i : int<br />
Row index of the coefficient.<br />
j : int<br />
Column index of coefficient.<br />
qoij : double<br />
<strong>The</strong> required coefficient.<br />
Description:<br />
Obtains one coefficient q o ij<br />
in the quadratic term of the objective.<br />
A.2.118<br />
Task.getreducedcosts()<br />
Task.getreducedcosts(<br />
whichsol,<br />
first,<br />
last,<br />
redcosts)<br />
Obtains the difference of (slx-sux) for a sequence of variables.<br />
Arguments<br />
first : int<br />
See formula (A.1) for the definition.<br />
last : int<br />
See formula (A.1) for the definition.<br />
redcosts : double[]<br />
<strong>The</strong> reduced costs in the required sequence of variables are stored sequentially in redcosts<br />
starting at redcosts[0].<br />
whichsol : soltype<br />
Selects a solution.
Change language