The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
212 APPENDIX A. API REFERENCE A.2.15 Task.chgbound() Task.chgbound( accmode, i, lower, finite, value) Changes the bounds for one constraint or variable. Arguments accmode : accmode Defines if operations are performed row-wise (constraint-oriented) or column-wise (variableoriented). finite : int If non-zero, then value is assumed to be finite. i : int Index of the constraint or variable for which the bounds should be changed. lower : int If non-zero, then the lower bound is changed, otherwise the upper bound is changed. value : double New value for the bound. Description: See also Changes a bound for one constraint or variable. If accmode equals accmode.con, a constraint bound is changed, otherwise a variable bound is changed. If lower is non-zero, then the lower bound is changed as follows: Otherwise if lower is zero, then { − ∞, finite = 0, new lower bound = value otherwise. { ∞, finite = 0, new upper bound = value otherwise. Please note that this function automatically updates the bound key for bound, in particular, if the lower and upper bounds are identical, the bound key is changed to fixed. • Task.putbound Changes the bound for either one constraint or one variable. • dparam.data tol bound inf Data tolerance threshold. • dparam.data tol bound wrn Data tolerance threshold.
A.2. CLASS TASK 213 A.2.16 Task.commitchanges() Task.commitchanges() Commits all cached problem changes. Description: Commits all cached problem changes to the task. It is usually not necessary explicitly to call this function since changes will be committed automatically when required. A.2.17 Task.deletesolution() Task.deletesolution(whichsol) Undefines a solution and frees the memory it uses. Arguments whichsol : soltype Selects a solution. Description: Undefines a solution and frees the memory it uses. A.2.18 Task.dualsensitivity() Task.dualsensitivity( subj, leftpricej, rightpricej, leftrangej, rightrangej) Performs sensitivity analysis on objective coefficients. Arguments leftpricej : double[] leftpricej[j] is the left shadow price for the coefficients with index subj[j]. leftrangej : double[] leftrangej[j] is the left range β 1 for the coefficient with index subj[j].
- Page 183 and 184: 12.7. UNDERSTANDING SOLUTION QUALIT
- 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: A.2. CLASS TASK 211 Description: If
- 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 and 284: A.2. CLASS TASK 261 max(l x j τ
212 APPENDIX A. <strong>API</strong> REFERENCE<br />
A.2.15<br />
Task.chgbound()<br />
Task.chgbound(<br />
accmode,<br />
i,<br />
lower,<br />
finite,<br />
value)<br />
Changes the bounds for one constraint or variable.<br />
Arguments<br />
accmode : accmode<br />
Defines if operations are performed row-wise (constraint-oriented) or column-wise (variableoriented).<br />
finite : int<br />
If non-zero, then value is assumed to be finite.<br />
i : int<br />
Index of the constraint or variable for which the bounds should be changed.<br />
lower : int<br />
If non-zero, then the lower bound is changed, otherwise the upper bound is changed.<br />
value : double<br />
New value for the bound.<br />
Description:<br />
See also<br />
Changes a bound for one constraint or variable. If accmode equals accmode.con, a constraint<br />
bound is changed, otherwise a variable bound is changed.<br />
If lower is non-zero, then the lower bound is changed as follows:<br />
Otherwise if lower is zero, then<br />
{ − ∞, finite = 0,<br />
new lower bound =<br />
value otherwise.<br />
{<br />
∞, finite = 0,<br />
new upper bound =<br />
value otherwise.<br />
Please note that this function automatically updates the bound key for bound, in particular, if<br />
the lower and upper bounds are identical, the bound key is changed to fixed.<br />
• Task.putbound Changes the bound for either one constraint or one variable.<br />
• dparam.data tol bound inf Data tolerance threshold.<br />
• dparam.data tol bound wrn Data tolerance threshold.