The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
218 APPENDIX A. API REFERENCE A.2.25 Task.getarownumnz() nzi = Task.getarownumnz(i) Obtains the number of non-zero elements in one row of the linear constraint matrix Arguments i : int Index of the row or column. nzi : int Number of non-zeros in the ith row of A. Description: Obtains the number of non-zero elements in one row of A. A.2.26 Task.getarowslicetrip() Task.getarowslicetrip( first, last, subi, subj, val) Obtains a sequence of rows from the coefficient matrix in triplet format. Arguments first : int Index of the first row or column in the sequence. last : int Index of the last row or column in the sequence plus one. subi : int[] Constraint subscripts. subj : int[] Column subscripts. val : double[] Values. Description: Obtains a sequence of rows from A in a sparse triplet format.
A.2. CLASS TASK 219 A.2.27 Task.getaslice() Task.getaslice( accmode, first, last, ptrb, ptre, sub, val) Obtains a sequence of rows or columns from the coefficient matrix. Arguments accmode : accmode Defines whether a column slice or a row slice is requested. first : int Index of the first row or column in the sequence. last : int Index of the last row or column in the sequence plus one. ptrb : long[] ptrb[t] is an index pointing to the first element in the tth row or column obtained. ptre : long[] ptre[t] is an index pointing to the last element plus one in the tth row or column obtained. sub : int[] Contains the row or column subscripts. val : double[] Contains the coefficient values. Description: See also Obtains a sequence of rows or columns from A in sparse format. • Task.getaslicenumnz Obtains the number of non-zeros in a slice of rows or columns of the coefficient matrix. A.2.28 Task.getaslicenumnz() numnz = Task.getaslicenumnz( accmode, first, last)
- Page 189 and 190: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 191 and 192: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 193 and 194: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 195 and 196: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 197 and 198: 13.2. ANALYZING INFEASIBLE PROBLEMS
- Page 199 and 200: Chapter 14 Primal feasibility repai
- Page 201 and 202: 14.2. AUTOMATIC REPAIR 179 One way
- Page 203 and 204: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 205 and 206: 14.3. FEASIBILITY REPAIR IN MOSEK 1
- Page 207 and 208: Chapter 15 Sensitivity analysis 15.
- Page 209 and 210: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 211 and 212: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 213 and 214: 15.4. SENSITIVITY ANALYSIS FOR LINE
- Page 215 and 216: 15.5. SENSITIVITY ANALYSIS FROM THE
- Page 217 and 218: 15.6. SENSITIVITY ANALYSIS WITH THE
- Page 219 and 220: 15.6. SENSITIVITY ANALYSIS WITH THE
- Page 221 and 222: Appendix A API reference This chapt
- Page 223 and 224: 201 • Task.relaxprimal Obtain inf
- Page 225 and 226: A.1. EXCEPTIONS 203 • Task.putvar
- 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: A.2. CLASS TASK 217 firsti : int In
- 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 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
218 APPENDIX A. <strong>API</strong> REFERENCE<br />
A.2.25<br />
Task.getarownumnz()<br />
nzi = Task.getarownumnz(i)<br />
Obtains the number of non-zero elements in one row of the linear constraint matrix<br />
Arguments<br />
i : int<br />
Index of the row or column.<br />
nzi : int<br />
Number of non-zeros in the ith row of A.<br />
Description:<br />
Obtains the number of non-zero elements in one row of A.<br />
A.2.26<br />
Task.getarowslicetrip()<br />
Task.getarowslicetrip(<br />
first,<br />
last,<br />
subi,<br />
subj,<br />
val)<br />
Obtains a sequence of rows from the coefficient matrix in triplet format.<br />
Arguments<br />
first : int<br />
Index of the first row or column in the sequence.<br />
last : int<br />
Index of the last row or column in the sequence plus one.<br />
subi : int[]<br />
Constraint subscripts.<br />
subj : int[]<br />
Column subscripts.<br />
val : double[]<br />
Values.<br />
Description:<br />
Obtains a sequence of rows from A in a sparse triplet format.
Change language