The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
162 CHAPTER 12. THE OPTIMIZERS FOR MIXED-INTEGER PROBLEMS
Chapter 13 The analyzers 13.1 The problem analyzer The problem analyzer prints a detailed survey of the • linear constraints and objective • quadratic constraints • conic constraints • variables of the model. In the initial stages of model formulation the problem analyzer may be used as a quick way of verifying that the model has been built or imported correctly. In later stages it can help revealing special structures within the model that may be used to tune the optimizer’s performance or to identify the causes of numerical difficulties. The problem analyzer is run from the command line using the -anapro argument and produces something similar to the following (this is the problemanalyzer’s survey of the aflow30a problem from the MIPLIB 2003 collection, see Appendix G for more examples): Analyzing the problem Constraints Bounds Variables upper bd: 421 ranged : all cont: 421 fixed : 58 bin : 421 ------------------------------------------------------------------------------- Objective, min cx range: min |c|: 0.00000 min |c|>0: 11.0000 max |c|: 500.000 distrib: |c| vars 0 421 163
- Page 133 and 134: 8.1. PORTFOLIO OPTIMIZATION 111 z j
- Page 135 and 136: 8.1. PORTFOLIO OPTIMIZATION 113 Var
- Page 137 and 138: 8.1. PORTFOLIO OPTIMIZATION 115 56
- Page 139 and 140: 8.1. PORTFOLIO OPTIMIZATION 117 172
- Page 141 and 142: Chapter 9 Usage guidelines The purp
- Page 143 and 144: 9.3. WRITING TASK DATA TO A FILE 12
- Page 145 and 146: Chapter 10 Problem formulation and
- Page 147 and 148: 10.1. LINEAR OPTIMIZATION 125 be a
- Page 149 and 150: 10.2. CONIC QUADRATIC OPTIMIZATION
- Page 151 and 152: 10.2. CONIC QUADRATIC OPTIMIZATION
- Page 153 and 154: 10.3. SEMIDEFINITE OPTIMIZATION 131
- Page 155 and 156: 10.4. QUADRATIC AND QUADRATICALLY C
- Page 157 and 158: Chapter 11 The optimizers for conti
- Page 159 and 160: 11.1. HOW AN OPTIMIZER WORKS 137 11
- Page 161 and 162: 11.2. LINEAR OPTIMIZATION 139 11.2.
- Page 163 and 164: 11.2. LINEAR OPTIMIZATION 141 Whene
- Page 165 and 166: 11.2. LINEAR OPTIMIZATION 143 11.2.
- Page 167 and 168: 11.2. LINEAR OPTIMIZATION 145 • R
- Page 169 and 170: 11.5. NONLINEAR CONVEX OPTIMIZATION
- Page 171 and 172: 11.6. SOLVING PROBLEMS IN PARALLEL
- Page 173 and 174: 11.6. SOLVING PROBLEMS IN PARALLEL
- Page 175 and 176: 11.6. SOLVING PROBLEMS IN PARALLEL
- Page 177 and 178: Chapter 12 The optimizers for mixed
- Page 179 and 180: 12.3. THE MIXED-INTEGER CONIC OPTIM
- Page 181 and 182: 12.5. TERMINATION CRITERION 159 •
- Page 183: 12.7. UNDERSTANDING SOLUTION QUALIT
- 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
Chapter 13<br />
<strong>The</strong> analyzers<br />
13.1 <strong>The</strong> problem analyzer<br />
<strong>The</strong> problem analyzer prints a detailed survey of the<br />
• linear constraints and objective<br />
• quadratic constraints<br />
• conic constraints<br />
• variables<br />
of the model.<br />
In the initial stages of model formulation the problem analyzer may be used as a quick way of verifying<br />
that the model has been built or imported correctly. In later stages it can help revealing special<br />
structures within the model that may be used to tune the <strong>optimizer</strong>’s performance or to identify the<br />
causes of numerical difficulties.<br />
<strong>The</strong> problem analyzer is run from the command line using the -anapro argument and produces something<br />
similar to the following (this is the problemanalyzer’s survey of the aflow30a problem from the<br />
MIPLIB 2003 collection, see Appendix G for more examples):<br />
Analyzing the problem<br />
Constraints Bounds Variables<br />
upper bd: 421 ranged : all cont: 421<br />
fixed : 58 bin : 421<br />
-------------------------------------------------------------------------------<br />
Objective, min cx<br />
range: min |c|: 0.00000 min |c|>0: 11.0000 max |c|: 500.000<br />
distrib: |c| vars<br />
0 421<br />
163