The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
230 APPENDIX A. API REFERENCE Obtains all objective coefficients. Arguments c : double[] Linear terms of the objective as a dense vector. The lengths is the number of variables. Description: Obtains all objective coefficients c. A.2.47 Task.getcfix() cfix = Task.getcfix() Obtains the fixed term in the objective. Arguments cfix : double Fixed term in the objective. Description: Obtains the fixed term in the objective. A.2.48 Task.getcj() cj = Task.getcj(j) Obtains one coefficient of c. Arguments cj : double The value of c j . j : int Index of the variable for which c coefficient should be obtained. Description: Obtains one coefficient of c. See also • Task.getcslice Obtains a sequence of coefficients from the objective.
A.2. CLASS TASK 231 A.2.49 Task.getconbound() bk,bl,bu = Task.getconbound(i) Obtains bound information for one constraint. Arguments bk : boundkey Bound keys. bl : double Values for lower bounds. bu : double Values for upper bounds. i : int Index of the constraint for which the bound information should be obtained. Description: Obtains bound information for one constraint. A.2.50 Task.getconboundslice() Task.getconboundslice( first, last, bk, bl, bu) Obtains bounds information for a slice of the constraints. Arguments bk : mosek.boundkey[] Bound keys. bl : double[] Values for lower bounds. bu : double[] Values for upper bounds. first : int First index in the sequence.
- 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 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: A.2. CLASS TASK 229 i : int Index o
- 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
- 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
A.2. CLASS TASK 231<br />
A.2.49<br />
Task.getconbound()<br />
bk,bl,bu = Task.getconbound(i)<br />
Obtains bound information for one constraint.<br />
Arguments<br />
bk : boundkey<br />
Bound keys.<br />
bl : double<br />
Values for lower bounds.<br />
bu : double<br />
Values for upper bounds.<br />
i : int<br />
Index of the constraint for which the bound information should be obtained.<br />
Description:<br />
Obtains bound information for one constraint.<br />
A.2.50<br />
Task.getconboundslice()<br />
Task.getconboundslice(<br />
first,<br />
last,<br />
bk,<br />
bl,<br />
bu)<br />
Obtains bounds information for a slice of the constraints.<br />
Arguments<br />
bk : mosek.boundkey[]<br />
Bound keys.<br />
bl : double[]<br />
Values for lower bounds.<br />
bu : double[]<br />
Values for upper bounds.<br />
first : int<br />
First index in the sequence.
Change language