The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek

25.11.2015 Views

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.

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.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!