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
322 BIBLIOGRAPHY [14] Wallace, S. W.. Decision making under uncertainty: Is sensitivity of any use. Oper. Res. January 1:20-25 [15] Nazareth, J. L.. Computer Solution of Linear Programs, 1987. Oxford University Press, New York
Index AMPL outlev, 13 wantsol, 13 arguments command line tool, 273 basis identification, 40 bounds, infinite, 20 certificate dual, 22, 25, 27, 29 primal, 22, 25, 27 complementarity conditions, 21 concurrent optimization, 47 concurrent solution, 46 conic optimization, 23 problem, 23 constraint matrix, 19, 30, 277 quadratic, 28 constraints lower limit, 19, 30, 277 upper limit, 19, 30, 277 continuous relaxation, 49 dual certificate, 22, 25, 27, 29 dual feasible, 20 dual infeasible, 20, 22, 25, 27, 29 duality gap, 20 dualizer, 35 eliminator, 35 feasible, dual, 20 feasible, primal, 20 hot-start, 42 infeasible, 61 dual, 22, 25, 27, 29 primal, 22, 25, 27 infeasible problems, 61 infeasible, dual, 20 infeasible, primal, 20 infinite bounds, 20 integer optimization, 49 relaxation, 49 interior-point optimizer, 37, 44, 45 interior-point or simplex optimizer, 43 linear dependency, 35 linear dependency check, 35 linear problem, 19 linearity interval, 72 LP format, 289 maximization problem, 21 mixed-integer optimization, 49 MPS format, 277 compBOUNDS, 284 compCOLUMNS, 280 free, 288 compNAME, 279 compOBJNAME, 280 compOBJSENSE, 279 compQSECTION, 282 compRANGES, 282 compRHS, 281 compROWS, 280 Network flow problems optimizing, 44 objective vector, 19 objective sense 323
- 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
- Page 319 and 320: 15.4. WRITING OPF FILES FROM MOSEK
- Page 321 and 322: 15.5. EXAMPLES 305 [/hints] [variab
- Page 323 and 324: 15.5. EXAMPLES 307 x1 x2 [/integer]
- Page 325 and 326: Chapter 16 The XML (OSiL) format MO
- Page 327 and 328: Chapter 17 The solution file format
- Page 329 and 330: 17.2. THE INTEGER SOLUTION FILE 313
- Page 331 and 332: Chapter 18 Problem analyzer example
- Page 333 and 334: 18.2. ARKI001 317 2 476 45.42 48.19
- Page 335 and 336: 18.4. PROBLEM WITH BOTH LINEAR AND
- Page 337: Bibliography [1] R. Fourer and D. M
- Page 341 and 342: INDEX 325 MSK RES ERR FEASREPAIR IN
- Page 343 and 344: INDEX 327 MSK RES ERR MPS NULL VAR
- Page 345 and 346: INDEX 329 MSK RES TRM MAX TIME, 226
Index<br />
AMPL<br />
outlev, 13<br />
wantsol, 13<br />
arguments<br />
<strong>command</strong> <strong>line</strong> <strong>tool</strong>, 273<br />
basis identification, 40<br />
bounds, infinite, 20<br />
certificate<br />
dual, 22, 25, 27, 29<br />
primal, 22, 25, 27<br />
complementarity conditions, 21<br />
concurrent optimization, 47<br />
concurrent solution, 46<br />
conic<br />
optimization, 23<br />
problem, 23<br />
constraint<br />
matrix, 19, 30, 277<br />
quadratic, 28<br />
constraints<br />
lower limit, 19, 30, 277<br />
upper limit, 19, 30, 277<br />
continuous relaxation, 49<br />
dual certificate, 22, 25, 27, 29<br />
dual feasible, 20<br />
dual infeasible, 20, 22, 25, 27, 29<br />
duality gap, 20<br />
dualizer, 35<br />
eliminator, 35<br />
feasible, dual, 20<br />
feasible, primal, 20<br />
hot-start, 42<br />
infeasible, 61<br />
dual, 22, 25, 27, 29<br />
primal, 22, 25, 27<br />
infeasible problems, 61<br />
infeasible, dual, 20<br />
infeasible, primal, 20<br />
infinite bounds, 20<br />
integer optimization, 49<br />
relaxation, 49<br />
interior-point optimizer, 37, 44, 45<br />
interior-point or simplex optimizer, 43<br />
<strong>line</strong>ar dependency, 35<br />
<strong>line</strong>ar dependency check, 35<br />
<strong>line</strong>ar problem, 19<br />
<strong>line</strong>arity interval, 72<br />
LP format, 289<br />
maximization problem, 21<br />
mixed-integer optimization, 49<br />
MPS format, 277<br />
compBOUNDS, 284<br />
compCOLUMNS, 280<br />
free, 288<br />
compNAME, 279<br />
compOBJNAME, 280<br />
compOBJSENSE, 279<br />
compQSECTION, 282<br />
compRANGES, 282<br />
compRHS, 281<br />
compROWS, 280<br />
Network flow problems<br />
optimizing, 44<br />
objective<br />
vector, 19<br />
objective sense<br />
323
Change language