The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
154 CHAPTER 11. THE OPTIMIZERS FOR CONTINUOUS PROBLEMS
Chapter 12 The optimizers for mixed-integer problems A problem is a mixed-integer optimization problem when one or more of the variables are constrained to be integer valued. MOSEK contains two optimizers for mixed integer problems that is capable for solving mixed-integer • linear, • quadratic and quadratically constrained, and • conic problems. Readers unfamiliar with integer optimization are recommended to consult some relevant literature, e.g. the book [16] by Wolsey. 12.1 Some concepts and facts related to mixed-integer optimization It is important to understand that in a worst-case scenario, the time required to solve integer optimization problems grows exponentially with the size of the problem. For instance, assume that a problem contains n binary variables, then the time required to solve the problem in the worst case may be proportional to 2 n . The value of 2 n is huge even for moderate values of n . In practice this implies that the focus should be on computing a near optimal solution quickly rather than at locating an optimal solution. Even if the problem is only solved approximately, it is important to know how far the approximate solution is from an optimal one. In order to say something about the goodness of an approximate solution then the concept of a relaxation is important. 155
- Page 125 and 126: 8.1. PORTFOLIO OPTIMIZATION 103 15
- Page 127 and 128: 8.1. PORTFOLIO OPTIMIZATION 105 63
- Page 129 and 130: 8.1. PORTFOLIO OPTIMIZATION 107 8.1
- Page 131 and 132: 8.1. PORTFOLIO OPTIMIZATION 109 110
- 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: 11.6. SOLVING PROBLEMS IN PARALLEL
- Page 179 and 180: 12.3. THE MIXED-INTEGER CONIC OPTIM
- Page 181 and 182: 12.5. TERMINATION CRITERION 159 •
- 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
Chapter 12<br />
<strong>The</strong> <strong>optimizer</strong>s for mixed-integer<br />
problems<br />
A problem is a mixed-integer optimization problem when one or more of the variables are constrained<br />
to be integer valued. <strong>MOSEK</strong> contains two <strong>optimizer</strong>s for mixed integer problems that is capable for<br />
solving mixed-integer<br />
• linear,<br />
• quadratic and quadratically constrained, and<br />
• conic<br />
problems.<br />
Readers unfamiliar with integer optimization are recommended to consult some relevant literature,<br />
e.g. the book [16] by Wolsey.<br />
12.1 Some concepts and facts related to mixed-integer optimization<br />
It is important to understand that in a worst-case scenario, the time required to solve integer optimization<br />
problems grows exponentially with the size of the problem. For instance, assume that a problem<br />
contains n binary variables, then the time required to solve the problem in the worst case may be<br />
proportional to 2 n . <strong>The</strong> value of 2 n is huge even for moderate values of n .<br />
In practice this implies that the focus should be on computing a near optimal solution quickly rather<br />
than at locating an optimal solution. Even if the problem is only solved approximately, it is important<br />
to know how far the approximate solution is from an optimal one. In order to say something about<br />
the goodness of an approximate solution then the concept of a relaxation is important.<br />
155