The MOSEK command line tool Version 7.0 (Revision 141)
The MOSEK command line tool. Version 7.0 ... - Documentation The MOSEK command line tool. Version 7.0 ... - Documentation
252 CHAPTER 11. API CONSTANTS MSK IINF MIO NUM KNAPSUR COVER CUTS Number of knapsack cover cuts. MSK IINF MIO NUM LATTICE CUTS Number of lattice cuts. MSK IINF MIO NUM LIFT CUTS Number of lift cuts. MSK IINF MIO NUM OBJ CUTS Number of obj cuts. MSK IINF MIO NUM PLAN LOC CUTS Number of loc cuts. MSK IINF MIO NUM RELAX Number of relaxations solved during the optimization. MSK IINF MIO NUMCON Number of constraints in the problem solved be the mixed-integer optimizer. MSK IINF MIO NUMINT Number of integer variables in the problem solved be the mixed-integer optimizer. MSK IINF MIO NUMVAR Number of variables in the problem solved be the mixed-integer optimizer. MSK IINF MIO OBJ BOUND DEFINED Non-zero if a valid objective bound has been found, otherwise zero. MSK IINF MIO TOTAL NUM CUTS Total number of cuts generated by the mixed-integer optimizer. MSK IINF MIO USER OBJ CUT If it is non-zero, then the objective cut is used. MSK IINF OPT NUMCON Number of constraints in the problem solved when the optimizer is called. MSK IINF OPT NUMVAR Number of variables in the problem solved when the optimizer is called MSK IINF OPTIMIZE RESPONSE The reponse code returned by optimize. MSK IINF RD NUMBARVAR Number of variables read.
11.13. INTEGER INFORMATION ITEMS. 253 MSK IINF RD NUMCON Number of constraints read. MSK IINF RD NUMCONE Number of conic constraints read. MSK IINF RD NUMINTVAR Number of integer-constrained variables read. MSK IINF RD NUMQ Number of nonempty Q matrixes read. MSK IINF RD NUMVAR Number of variables read. MSK IINF RD PROTYPE Problem type. MSK IINF SIM DUAL DEG ITER The number of dual degenerate iterations. MSK IINF SIM DUAL HOTSTART If 1 then the dual simplex algorithm is solving from an advanced basis. MSK IINF SIM DUAL HOTSTART LU If 1 then a valid basis factorization of full rank was located and used by the dual simplex algorithm. MSK IINF SIM DUAL INF ITER The number of iterations taken with dual infeasibility. MSK IINF SIM DUAL ITER Number of dual simplex iterations during the last optimization. MSK IINF SIM NETWORK DUAL DEG ITER The number of dual network degenerate iterations. MSK IINF SIM NETWORK DUAL HOTSTART If 1 then the dual network simplex algorithm is solving from an advanced basis. MSK IINF SIM NETWORK DUAL HOTSTART LU If 1 then a valid basis factorization of full rank was located and used by the dual network simplex algorithm. MSK IINF SIM NETWORK DUAL INF ITER The number of iterations taken with dual infeasibility in the network optimizer.
- Page 217 and 218: 9.3. MSKSPARAME: STRING PARAMETER T
- Page 219 and 220: Chapter 10 Response codes Response
- Page 221 and 222: 205 MSK RES ERR CON Q NOT PSD The q
- Page 223 and 224: 207 MSK RES ERR GLOBAL INV CONIC PR
- Page 225 and 226: 209 MSK RES ERR INV MARKJ Invalid v
- Page 227 and 228: 211 MSK RES ERR INVALID FORMAT TYPE
- Page 229 and 230: 213 MSK RES ERR LICENSE NO SERVER S
- Page 231 and 232: 215 MSK RES ERR MIO NO OPTIMIZER No
- Page 233 and 234: 217 MSK RES ERR NAME MAX LEN A name
- Page 235 and 236: 219 MSK RES ERR NUMCONLIM Maximum n
- Page 237 and 238: 221 MSK RES ERR QCON UPPER TRIANGLE
- Page 239 and 240: 223 MSK RES ERR SYM MAT INVALID COL
- Page 241 and 242: 225 MSK RES ERR USER NLO FUNC The u
- Page 243 and 244: 227 MSK RES WRN ANA ALMOST INT BOUN
- Page 245 and 246: 229 MSK RES WRN MIO INFEASIBLE FINA
- Page 247 and 248: 231 MSK RES WRN WRITE DISCARDED CFI
- Page 249 and 250: Chapter 11 API constants 11.1 Const
- Page 251 and 252: 11.5. PROGRESS CALL-BACK CODES 235
- Page 253 and 254: 11.5. PROGRESS CALL-BACK CODES 237
- Page 255 and 256: 11.5. PROGRESS CALL-BACK CODES 239
- Page 257 and 258: 11.5. PROGRESS CALL-BACK CODES 241
- Page 259 and 260: 11.6. TYPES OF CONVEXITY CHECKS. 24
- Page 261 and 262: 11.10. DOUBLE INFORMATION ITEMS 245
- Page 263 and 264: 11.10. DOUBLE INFORMATION ITEMS 247
- Page 265 and 266: 11.11. FEASIBILITY REPAIR TYPES 249
- Page 267: 11.13. INTEGER INFORMATION ITEMS. 2
- Page 271 and 272: 11.13. INTEGER INFORMATION ITEMS. 2
- Page 273 and 274: 11.17. LANGUAGE SELECTION CONSTANTS
- Page 275 and 276: 11.22. MIXED-INTEGER NODE SELECTION
- Page 277 and 278: 11.29. ORDERING STRATEGIES 261 MSK
- Page 279 and 280: 11.34. PROBLEM STATUS KEYS 263 MSK
- Page 281 and 282: 11.38. SENSITIVITY TYPES 265 MSK SC
- Page 283 and 284: 11.44. SOLUTION ITEMS 267 MSK SIM S
- Page 285 and 286: 11.46. SOLUTION TYPES 269 11.46 Sol
- Page 287 and 288: 11.52. INTEGER VALUES 271 11.52 Int
- Page 289 and 290: Chapter 12 MOSEK Command line tool
- Page 291 and 292: 12.3. THE PARAMETER FILE 275 -min F
- Page 293 and 294: Chapter 13 The MPS file format MOSE
- Page 295 and 296: 13.1. MPS FILE STRUCTURE 279 Extens
- Page 297 and 298: 13.1. MPS FILE STRUCTURE 281 [vname
- Page 299 and 300: 13.1. MPS FILE STRUCTURE 283 Field
- Page 301 and 302: 13.1. MPS FILE STRUCTURE 285 Next d
- Page 303 and 304: 13.2. INTEGER VARIABLES 287 13.2 In
- Page 305 and 306: Chapter 14 The LP file format MOSEK
- Page 307 and 308: 14.1. THE SECTIONS 291 x1 * x2 Ther
- Page 309 and 310: 14.2. LP FORMAT PECULIARITIES 293 1
- Page 311 and 312: 14.3. THE STRICT LP FORMAT 295 MSK
- Page 313 and 314: Chapter 15 The OPF format The Optim
- Page 315 and 316: 15.2. THE FILE FORMAT 299 [con ’c
- Page 317 and 318: 15.2. THE FILE FORMAT 301 - ‘NEAR
11.13. INTEGER INFORMATION ITEMS. 253<br />
MSK IINF RD NUMCON<br />
Number of constraints read.<br />
MSK IINF RD NUMCONE<br />
Number of conic constraints read.<br />
MSK IINF RD NUMINTVAR<br />
Number of integer-constrained variables read.<br />
MSK IINF RD NUMQ<br />
Number of nonempty Q matrixes read.<br />
MSK IINF RD NUMVAR<br />
Number of variables read.<br />
MSK IINF RD PROTYPE<br />
Problem type.<br />
MSK IINF SIM DUAL DEG ITER<br />
<strong>The</strong> number of dual degenerate iterations.<br />
MSK IINF SIM DUAL HOTSTART<br />
If 1 then the dual simplex algorithm is solving from an advanced basis.<br />
MSK IINF SIM DUAL HOTSTART LU<br />
If 1 then a valid basis factorization of full rank was located and used by the dual simplex<br />
algorithm.<br />
MSK IINF SIM DUAL INF ITER<br />
<strong>The</strong> number of iterations taken with dual infeasibility.<br />
MSK IINF SIM DUAL ITER<br />
Number of dual simplex iterations during the last optimization.<br />
MSK IINF SIM NETWORK DUAL DEG ITER<br />
<strong>The</strong> number of dual network degenerate iterations.<br />
MSK IINF SIM NETWORK DUAL HOTSTART<br />
If 1 then the dual network simplex algorithm is solving from an advanced basis.<br />
MSK IINF SIM NETWORK DUAL HOTSTART LU<br />
If 1 then a valid basis factorization of full rank was located and used by the dual network simplex<br />
algorithm.<br />
MSK IINF SIM NETWORK DUAL INF ITER<br />
<strong>The</strong> number of iterations taken with dual infeasibility in the network optimizer.
Change language