The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
214 APPENDIX A. API REFERENCE rightpricej : double[] rightpricej[j] is the right shadow price for the coefficients with index subj[j]. rightrangej : double[] rightrangej[j] is the right range β 2 for the coefficient with index subj[j]. subj : int[] Index of objective coefficients to analyze. Description: See also Calculates sensitivity information for objective coefficients. The indexes of the coefficients to analyze are {subj[i]|i ∈ 0, . . . , numj − 1} The results are returned so that e.g leftprice[j] is the left shadow price of the objective coefficient with index subj[j]. The type of sensitivity analysis to perform (basis or optimal partition) is controlled by the parameter iparam.sensitivity type. For an example, please see Section 15.5. • Task.primalsensitivity Perform sensitivity analysis on bounds. • Task.sensitivityreport Creates a sensitivity report. • iparam.sensitivity type Controls which type of sensitivity analysis is to be performed. • iparam.log sensitivity Control logging in sensitivity analyzer. • iparam.log sensitivity opt Control logging in sensitivity analyzer. A.2.19 Task.getacol() nzj = Task.getacol( j, subj, valj) Obtains one column of the linear constraint matrix. Arguments j : int Index of the column. nzj : int Number of non-zeros in the column obtained.
A.2. CLASS TASK 215 subj : int[] Index of the non-zeros in the row obtained. valj : double[] Numerical values of the column obtained. Description: Obtains one row of A in a sparse format. A.2.20 Task.getacolnumnz() nzj = Task.getacolnumnz(i) Obtains the number of non-zero elements in one column of the linear constraint matrix Arguments i : int Index of the column. nzj : int Number of non-zeros in the jth row or column of A. Description: Obtains the number of non-zero elements in one column of A. A.2.21 Task.getacolslicetrip() Task.getacolslicetrip( first, last, subi, subj, val) Obtains a sequence of columns from the coefficient matrix in triplet format. Arguments first : int Index of the first column in the sequence. last : int Index of the last column in the sequence plus one.
- Page 185 and 186: Chapter 13 The analyzers 13.1 The p
- Page 187 and 188: 13.1. THE PROBLEM ANALYZER 165 Cons
- 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: A.2. CLASS TASK 213 A.2.16 Task.com
- 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 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
214 APPENDIX A. <strong>API</strong> REFERENCE<br />
rightpricej : double[]<br />
rightpricej[j] is the right shadow price for the coefficients with index subj[j].<br />
rightrangej : double[]<br />
rightrangej[j] is the right range β 2 for the coefficient with index subj[j].<br />
subj : int[]<br />
Index of objective coefficients to analyze.<br />
Description:<br />
See also<br />
Calculates sensitivity information for objective coefficients. <strong>The</strong> indexes of the coefficients to<br />
analyze are<br />
{subj[i]|i ∈ 0, . . . , numj − 1}<br />
<strong>The</strong> results are returned so that e.g leftprice[j] is the left shadow price of the objective coefficient<br />
with index subj[j].<br />
<strong>The</strong> type of sensitivity analysis to perform (basis or optimal partition) is controlled by the<br />
parameter iparam.sensitivity type.<br />
For an example, please see Section 15.5.<br />
• Task.primalsensitivity Perform sensitivity analysis on bounds.<br />
• Task.sensitivityreport Creates a sensitivity report.<br />
• iparam.sensitivity type Controls which type of sensitivity analysis is to be performed.<br />
• iparam.log sensitivity Control logging in sensitivity analyzer.<br />
• iparam.log sensitivity opt Control logging in sensitivity analyzer.<br />
A.2.19<br />
Task.getacol()<br />
nzj = Task.getacol(<br />
j,<br />
subj,<br />
valj)<br />
Obtains one column of the linear constraint matrix.<br />
Arguments<br />
j : int<br />
Index of the column.<br />
nzj : int<br />
Number of non-zeros in the column obtained.