The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
304 APPENDIX A. API REFERENCE Replaces all elements in several columns the linear constraint matrix by new values. Arguments asub : int[] asub contains the new variable indexes. aval : double[] Coefficient coefficient values. first : int First column in the slice. last : int Last column plus one in the slice. ptrb : long[] Array of pointers to the first element in the columns stored in asub and aval. For an explanation of the meaning of ptrb see Section 5.13.3.2. ptre : long[] Array of pointers to the last element plus one in the columns stored in asub and aval. For an explanation of the meaning of ptre see Section 5.13.3.2. Description: See also Replaces all elements in a set of columns of A. • Task.putmaxnumanz The function changes the size of the preallocated storage for linear coefficients. A.2.177 Task.putaij() Task.putaij( i, j, aij) Changes a single value in the linear coefficient matrix. Arguments aij : double New coefficient for a i,j . i : int Index of the constraint in which the change should occur.
A.2. CLASS TASK 305 j : int Index of the variable in which the change should occur. Description: Changes a coefficient in A using the method See also a ij = aij. • Task.putarow Replaces all elements in one row of A. • Task.putacol Replaces all elements in one column of A. • Task.putaij Changes a single value in the linear coefficient matrix. • Task.putmaxnumanz The function changes the size of the preallocated storage for linear coefficients. A.2.178 Task.putaijlist() Task.putaijlist( subi, subj, valij) Changes one or more coefficients in the linear constraint matrix. Arguments subi : int[] Constraint indexes in which the change should occur. subj : int[] Variable indexes in which the change should occur. valij : double[] New coefficient values for a i,j . Description: Changes one or more coefficients in A using the method See also a subi[k],subj[k] = valij[k], k = 0, . . . , num − 1. If the same a i,j entry appears multiple times only the last one will be used.
- 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 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: A.2. CLASS TASK 303 A.2.175 Task.pu
- 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
- Page 347 and 348: A.2. CLASS TASK 325 Sets a string p
- Page 349 and 350: A.2. CLASS TASK 327 Description: Re
- Page 351 and 352: A.2. CLASS TASK 329 qosubj : int[]
- Page 353 and 354: A.2. CLASS TASK 331 Sets the status
- Page 355 and 356: A.2. CLASS TASK 333 A.2.224 Task.pu
- Page 357 and 358: A.2. CLASS TASK 335 Arguments sux :
- Page 359 and 360: A.2. CLASS TASK 337 y : double[] Ve
- Page 361 and 362: A.2. CLASS TASK 339 A.2.233 Task.pu
- Page 363 and 364: A.2. CLASS TASK 341 last : int Last
- Page 365 and 366: A.2. CLASS TASK 343 See also • Ta
- Page 367 and 368: A.2. CLASS TASK 345 A.2.243 Task.pu
- Page 369 and 370: A.2. CLASS TASK 347 Description: Se
- Page 371 and 372: A.2. CLASS TASK 349 Sets a slice of
- Page 373 and 374: A.2. CLASS TASK 351 A.2.254 Task.re
- Page 375 and 376: A.2. CLASS TASK 353 wux : double[]
A.2. CLASS TASK 305<br />
j : int<br />
Index of the variable in which the change should occur.<br />
Description:<br />
Changes a coefficient in A using the method<br />
See also<br />
a ij = aij.<br />
• Task.putarow Replaces all elements in one row of A.<br />
• Task.putacol Replaces all elements in one column of A.<br />
• Task.putaij Changes a single value in the linear coefficient matrix.<br />
• Task.putmaxnumanz <strong>The</strong> function changes the size of the preallocated storage for linear<br />
coefficients.<br />
A.2.178<br />
Task.putaijlist()<br />
Task.putaijlist(<br />
subi,<br />
subj,<br />
valij)<br />
Changes one or more coefficients in the linear constraint matrix.<br />
Arguments<br />
subi : int[]<br />
Constraint indexes in which the change should occur.<br />
subj : int[]<br />
Variable indexes in which the change should occur.<br />
valij : double[]<br />
New coefficient values for a i,j .<br />
Description:<br />
Changes one or more coefficients in A using the method<br />
See also<br />
a subi[k],subj[k] = valij[k], k = 0, . . . , num − 1.<br />
If the same a i,j entry appears multiple times only the last one will be used.
Change language