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
56 CHAPTER 6. THE OPTIMIZERS FOR MIXED-INTEGER PROBLEMS
Chapter 7 The analyzers 7.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 18 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 57
- Page 21 and 22: Chapter 1 Changes and new features
- Page 23 and 24: 1.4. OPTIMIZATION TOOLBOX FOR MATLA
- Page 25 and 26: Chapter 2 What is MOSEK MOSEK is a
- Page 27 and 28: Chapter 3 MOSEK and AMPL AMPL is a
- Page 29 and 30: 3.6. CONSTRAINT AND VARIABLE NAMES
- Page 31 and 32: 3.8. HOT-START 15 Linear dependency
- Page 33 and 34: 3.10. SENSITIVITY ANALYSIS 17 • .
- Page 35 and 36: Chapter 4 Problem formulation and s
- Page 37 and 38: 4.1. LINEAR OPTIMIZATION 21 be a pr
- Page 39 and 40: 4.2. CONIC QUADRATIC OPTIMIZATION 2
- Page 41 and 42: 4.2. CONIC QUADRATIC OPTIMIZATION 2
- Page 43 and 44: 4.3. SEMIDEFINITE OPTIMIZATION 27 4
- Page 45 and 46: 4.5. GENERAL CONVEX OPTIMIZATION 29
- Page 47 and 48: 4.5. GENERAL CONVEX OPTIMIZATION 31
- Page 49 and 50: Chapter 5 The optimizers for contin
- Page 51 and 52: 5.1. HOW AN OPTIMIZER WORKS 35 5.1.
- Page 53 and 54: 5.2. LINEAR OPTIMIZATION 37 5.2.2 T
- Page 55 and 56: 5.2. LINEAR OPTIMIZATION 39 Wheneve
- Page 57 and 58: 5.2. LINEAR OPTIMIZATION 41 5.2.2.3
- Page 59 and 60: 5.2. LINEAR OPTIMIZATION 43 • Rai
- Page 61 and 62: 5.5. NONLINEAR CONVEX OPTIMIZATION
- Page 63 and 64: 5.6. SOLVING PROBLEMS IN PARALLEL 4
- Page 65 and 66: Chapter 6 The optimizers for mixed-
- Page 67 and 68: 6.3. THE MIXED-INTEGER CONIC OPTIMI
- Page 69 and 70: 6.5. TERMINATION CRITERION 53 The f
- Page 71: 6.7. UNDERSTANDING SOLUTION QUALITY
- Page 75 and 76: 7.1. THE PROBLEM ANALYZER 59 Constr
- Page 77 and 78: 7.2. ANALYZING INFEASIBLE PROBLEMS
- Page 79 and 80: 7.2. ANALYZING INFEASIBLE PROBLEMS
- Page 81 and 82: 7.2. ANALYZING INFEASIBLE PROBLEMS
- Page 83 and 84: 7.2. ANALYZING INFEASIBLE PROBLEMS
- Page 85 and 86: 7.2. ANALYZING INFEASIBLE PROBLEMS
- Page 87 and 88: Chapter 8 Sensitivity analysis 8.1
- Page 89 and 90: 8.4. SENSITIVITY ANALYSIS FOR LINEA
- Page 91 and 92: 8.5. SENSITIVITY ANALYSIS WITH THE
- Page 93 and 94: 8.5. SENSITIVITY ANALYSIS WITH THE
- Page 95 and 96: Chapter 9 Parameters Parameters gro
- Page 97 and 98: 81 • MSK SPAR ITR SOL FILE NAME.
- Page 99 and 100: 83 • MSK DPAR INTPNT NL TOL REL G
- Page 101 and 102: 85 • MSK IPAR LOG MIO. Controls t
- Page 103 and 104: 87 • MSK DPAR INTPNT NL MERIT BAL
- Page 105 and 106: 89 • MSK IPAR INFEAS PREFER PRIMA
- Page 107 and 108: 91 • MSK IPAR SIM SAVE LU. Contro
- Page 109 and 110: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 111 and 112: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 113 and 114: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 115 and 116: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 117 and 118: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 119 and 120: 9.1. MSKDPARAME: DOUBLE PARAMETERS
- Page 121 and 122: 9.1. MSKDPARAME: DOUBLE PARAMETERS
Chapter 7<br />
<strong>The</strong> analyzers<br />
7.1 <strong>The</strong> problem analyzer<br />
<strong>The</strong> problem analyzer prints a detailed survey of the<br />
• <strong>line</strong>ar 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 optimizer’s performance or to identify the<br />
causes of numerical difficulties.<br />
<strong>The</strong> problem analyzer is run from the <strong>command</strong> <strong>line</strong> 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 18 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 />
57
Change language