The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
172 CHAPTER 13. THE ANALYZERS mosek -d iparam.infeas report auto onoffkey.on infeas.lp -info rinfeas.lp produces the files rinfeas.bas.inf.lp. In this case the content of the file rinfeas.bas.inf.lp is minimize Obj: + CFIXVAR st s0: + x11 + x12
13.2. ANALYZING INFEASIBLE PROBLEMS 173 is dual infeasible. This can be verified by proving that y1=-1, y2=-1, y3=0, y4=1, y5=1 is a certificate of dual infeasibility. (slightly edited): The following constraints are involved in the infeasibility. In this example the following infeasibility report is produced Index Name Activity Objective Lower bound Upper bound 0 x11 -1.000000e+00 NONE 1.000000e+00 4 x31 -1.000000e+00 NONE 1.000000e+00 The following variables are involved in the infeasibility. Index Name Activity Objective Lower bound Upper bound 3 y4 -1.000000e+00 -1.100000e+03 NONE NONE Interior-point solution Problem status : DUAL INFEASIBLE Solution status : DUAL INFEASIBLE CER Primal - objective: 1.1000000000e+03 eq. infeas.: 0.00e+00 max bound infeas.: 0.00e+00 cone infeas.: 0.00e+00 Dual - objective: 0.0000000000e+00 eq. infeas.: 0.00e+00 max bound infeas.: 0.00e+00 cone infeas.: 0.00e+00 Let x ∗ denote the reported primal solution. MOSEK states • that the problem is dual infeasible, • that the reported solution is a certificate of dual infeasibility, and • that the infeasibility measure for x ∗ is approximately zero. Since it was an maximization problem, this implies that c t x ∗ > 0. (13.2) For a minimization problem this inequality would have been reversed — see (13.5). From the infeasibility report we see that the variable y4, and the constraints x11 and x33 are involved in the infeasibility since these appear with non-zero values in the ”Activity” column. One possible strategy to ”fix” the infeasibility is to modify the problem so that the certificate of infeasibility becomes invalid. In this case we may do one the following things: • Put a lower bound in y3. This will directly invalidate the certificate of dual infeasibility. • Increase the object coefficient of y3. Changing the coefficients sufficiently will invalidate the inequality (13.2) and thus the certificate. • Put lower bounds on x11 or x31. This will directly invalidate the certificate of infeasibility. Please note that modifying the problem to invalidate the reported certificate does not imply that the problem becomes dual feasible — the infeasibility may simply ”move”, resulting in a new infeasibility. More often, the reported certificate can be used to give a hint about errors or inconsistencies in the model that produced the problem.
- 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 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: 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
- 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
172 CHAPTER 13. THE ANALYZERS<br />
mosek -d iparam.infeas report auto onoffkey.on infeas.lp -info rinfeas.lp<br />
produces the files rinfeas.bas.inf.lp. In this case the content of the file rinfeas.bas.inf.lp is<br />
minimize<br />
Obj: + CFIXVAR<br />
st<br />
s0: + x11 + x12
Change language