MINTO, a Mixed INTeger Optimizer -- version 3.1.0 (LINUX/COIN-OSI) Copyright (C) 1992-2004 -- M.W.P. Savelsbergh Coin0001I At line 1 NAME NEOS8 Coin0001I At line 2 ROWS Coin0001I At line 46328 COLUMNS Coin0001I At line 359543 RHS Coin0001I At line 382620 BOUNDS Coin0001I At line 405849 ENDATA Coin0002I Problem NEOS8 has 46324 rows, 23228 columns and 313180 elements MINTO: Solving problem NEOS8 MINTO: Problem statistics: Number of constraints: 46324 Number of variables: 23228 (0) Number of nonzero's: 313180 Number of continuous variables: 0 Number of binary variables: 23224 Number of integer variables: 4 MINTO: Presolve eliminated 42912 constraints and 21512 variables Presolve made 656 coefficient changes MINTO: Row structure analysis (after preprocessing): Number of constraints of type MIXUB: 4 Number of constraints of type ALLBINUB: 3280 Number of constraints of type ALLBINEQ: 12 Number of constraints of type BINSUM1UB: 116 MINTO control parameters: Objective sense : minimization Output level : 1 Maximum cpu time : 1000000 Maximum #nodes : 1000000 MINTO system function activity levels: Bound improvement : active Branching type : 3 Node selection type : 5 Preprocessing level : 1 Primal heuristic : active Clique cuts : active Implication cuts : active Knapsack covers : active GUB covers : active Flow covers : active Row management : active Restarts : active Force branching : 1 Advanced basis : active Names mode level : 0 MINTO: Updating primal (MINTO heuristic) Value: 3719.00 Elapsed time: 5.58 Node: 1 MINTO: Value of solution: -3719.000000 MINTO: Non-zero variables in the solution: xopt[2] = 1.000000 (C0003) xopt[6] = 1.000000 (C0007) xopt[16] = 1.000000 (C0017) xopt[31] = 1.000000 (C0032) xopt[34] = 1.000000 (C0035) xopt[35] = 1.000000 (C0036) xopt[37] = 1.000000 (C0038) xopt[38] = 1.000000 (C0039) xopt[39] = 1.000000 (C0040) xopt[76] = 1.000000 (C0077) xopt[80] = 1.000000 (C0081) xopt[81] = 1.000000 (C0082) xopt[84] = 1.000000 (C0085) xopt[85] = 1.000000 (C0086) xopt[86] = 1.000000 (C0087) xopt[140] = 1.000000 (C0141) xopt[144] = 1.000000 (C0145) xopt[145] = 1.000000 (C0146) xopt[148] = 1.000000 (C0149) xopt[149] = 1.000000 (C0150) xopt[150] = 1.000000 (C0151) xopt[300] = 1.000000 (C0301) xopt[304] = 1.000000 (C0305) xopt[305] = 1.000000 (C0306) xopt[308] = 1.000000 (C0309) xopt[309] = 1.000000 (C0310) xopt[310] = 1.000000 (C0311) xopt[546] = 1.000000 (C0547) xopt[550] = 1.000000 (C0551) xopt[560] = 1.000000 (C0561) xopt[658] = 1.000000 (C0659) xopt[662] = 1.000000 (C0663) xopt[672] = 1.000000 (C0673) xopt[938] = 1.000000 (C0939) xopt[942] = 1.000000 (C0943) xopt[952] = 1.000000 (C0953) xopt[2898] = 1.000000 (C2899) xopt[2902] = 1.000000 (C2903) xopt[2912] = 1.000000 (C2913) xopt[3010] = 1.000000 (C3011) xopt[3014] = 1.000000 (C3015) xopt[3024] = 1.000000 (C3025) xopt[3290] = 1.000000 (C3291) xopt[3294] = 1.000000 (C3295) xopt[3304] = 1.000000 (C3305) xopt[6034] = 1.000000 (C6035) xopt[6038] = 1.000000 (C6039) xopt[6048] = 1.000000 (C6049) xopt[6146] = 1.000000 (C6147) xopt[6150] = 1.000000 (C6151) xopt[6160] = 1.000000 (C6161) xopt[6426] = 1.000000 (C6427) xopt[6430] = 1.000000 (C6431) xopt[6440] = 1.000000 (C6441) xopt[13874] = 1.000000 (C13875) xopt[13878] = 1.000000 (C13879) xopt[13888] = 1.000000 (C13889) xopt[13986] = 1.000000 (C13987) xopt[13990] = 1.000000 (C13991) xopt[14000] = 1.000000 (C14001) xopt[14266] = 1.000000 (C14267) xopt[14270] = 1.000000 (C14271) xopt[14280] = 1.000000 (C14281) xopt[23224] = 14.000000 (C23225) xopt[23225] = 12.000000 (C23226) xopt[23226] = 9.000000 (C23227) xopt[23227] = 4.000000 (C23228) zopt = -3719.000000 zroot = -3719.000000 zinit = -3725.000000 MINTO: Branch and bound statistics Maximum number of unevaluated nodes = 1 Number of evaluated nodes = 1 Depth of the tree = 0 Number of linear programs solved = 2 Maximum number of rows in active LP = 3412 (3412) MINTO: Cut generation statistics Number of generated clique inequalities = 0 Number of generated implication inequalities = 0 Number of generated lifted knapsack covers = 0 Knapsack covers = 0 Knapsack covers with GUBs = 0 Surrogate knapsack covers = 0 Number of generated generalized flow covers = 0 APPL: Timing statistics (in seconds) appl_bounds: 0.00 appl_constraints: 0.00 appl_delconstraints: 0.00 appl_divide: 0.00 appl_exit: 0.00 appl_fathom: 0.00 appl_feasible: 0.00 appl_init: 0.00 appl_initlp: 0.00 appl_mps: 0.00 appl_node: 0.00 appl_preprocessing: 0.00 appl_primal: 0.00 appl_rank: 0.00 appl_terminatelp: 0.00 appl_terminatenode: 0.00 appl_variables: 0.00 MINTO: Timing statistics (in seconds) Reading MPS file: 0.30 Restart: 0.12 Preprocessing and probing: 5.18 Primal heuristic: 0.02 Bound improvement: 0.00 Clique cut generation: 0.00 Implication cut generation: 0.00 Knapsack cover generation: 0.00 GUB cover generation: 0.00 Surrogate knapsack cover generation: 0.00 Flow cover generation: 0.00 Cut pool search: 0.00 Cut Management: 0.00 Branching: 0.00 Time LP solving: 0.05 Total elapsed time: 5.71 Command exited with non-zero status 177 5.53user 0.18system 0:05.72elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+17867minor)pagefaults 0swaps