c:\Users\s001287\Documents\project\Dip-0.8.7\Dip\MSVisualStudio\v9\DecompExamples\Debug>silcep --param ..\silcep\silcep.pa ======================================================== ======================================================== Welcome to the DIP Decomposition Framework Copyright 2002-2010 Lehigh University and others All Rights Reserved Distributed under the Eclipse Public License 1.0 Version: 0.8.7 Build Date: Jan 5 2011 ======================================================== ======================================================== numCols=61 numTimePeriods=4numNodes=4 numArcs=5 numCols=61 numColsOrig=61 numRows=20 Generating sub-problem 0 numCols=61 numColsOrig=61 numRows=21 Generating sub-problem 1 numCols=61 numColsOrig=61 numRows=21 Generating sub-problem 2 numCols=61 numColsOrig=61 numRows=21 Generating sub-problem 3 numCols=61 numColsOrig=61 numRows=21 Initial Algo Setup (algo = PRICE_AND_CUT) D-ALGO : 0.499 [CPU: 0.514 ] <--- initSetup() ------------- ======================================================== DECOMP PARAMETER SETTINGS PRICE_AND_CUT LogLevel 3 PRICE_AND_CUT LogDebugLevel 3 PRICE_AND_CUT LogLpLevel 1 PRICE_AND_CUT LogDumpModel 0 PRICE_AND_CUT LimitInitVars 5 PRICE_AND_CUT DebugLevel 0 PRICE_AND_CUT TolZero 1e-006 PRICE_AND_CUT LimitTotalCutIters 2147483647 PRICE_AND_CUT LimitTotalPriceIters 2147483647 PRICE_AND_CUT LimitRoundCutIters 2147483647 PRICE_AND_CUT LimitRoundPriceIters 2147483647 PRICE_AND_CUT LimitTime 1.8e+308 PRICE_AND_CUT TailoffLength 10 PRICE_AND_CUT TailoffPercent 0.1 PRICE_AND_CUT MasterGapLimit 0.01 PRICE_AND_CUT CompressColumns 1 PRICE_AND_CUT CompressColumnsIterFreq 2 PRICE_AND_CUT CompressColumnsSizeMultLimit1.2 PRICE_AND_CUT CutDC 0 PRICE_AND_CUT CutCGL 1 PRICE_AND_CUT CutCglKnapC 1 PRICE_AND_CUT CutCglFlowC 1 PRICE_AND_CUT CutCglMir 1 PRICE_AND_CUT CutCglClique 1 PRICE_AND_CUT CutCglOddHole 1 PRICE_AND_CUT CutCglGomory 0 PRICE_AND_CUT SubProbUseCutoff 0 PRICE_AND_CUT SubProbGapLimitExact 0.0001 PRICE_AND_CUT SubProbGapLimitInexact 0.1 PRICE_AND_CUT SubProbTimeLimitExact 1.8e+308 PRICE_AND_CUT SubProbTimeLimitInexact 1.8e+308 PRICE_AND_CUT SubProbNumThreads 1 PRICE_AND_CUT SubProbNumSolLimit 1 PRICE_AND_CUT SubProbSolverStartAlgo 0 PRICE_AND_CUT RoundRobinInterval 0 PRICE_AND_CUT RoundRobinStrategy 0 PRICE_AND_CUT SolveMasterAsIp 1 PRICE_AND_CUT SolveMasterAsIpFreqNode 1 PRICE_AND_CUT SolveMasterAsIpFreqPass 1000 PRICE_AND_CUT SolveMasterAsIpLimitTime 30 PRICE_AND_CUT SolveMasterAsIpLimitGap 0.05 PRICE_AND_CUT SolveMasterUpdateAlgo 0 PRICE_AND_CUT SolveRelaxAsIp 0 PRICE_AND_CUT InitVarsWithCutDC 0 PRICE_AND_CUT InitVarsWithIP 0 PRICE_AND_CUT InitVarsWithIPLimitTime 10 PRICE_AND_CUT InitCompactSolve 0 PRICE_AND_CUT DualStab 0 PRICE_AND_CUT DualStabAlpha 0.1 PRICE_AND_CUT BreakOutPartial 0 PRICE_AND_CUT BranchEnforceInSubProb 0 PRICE_AND_CUT BranchEnforceInMaster 1 PRICE_AND_CUT MasterConvexityLessThan 0 PRICE_AND_CUT ParallelColsLimit 1 ======================================================== D-ALGO : 2 [CPU: 2.01 ] <--- getModelsFromApp() ------ D-ALGO : 2.03 [CPU: 2.043 ] --- getModelsFromApp() ------> funcT = 0.031 ModelCore cols: 61 rows: 20 D-ALGO : 2.09 [CPU: 2.11 ] <--- checkBlocksColumns() ---- D-ALGO : 2.14 [CPU: 2.15 ] <--- createOsiSubProblem() --- D-ALGO : 2.18 [CPU: 2.199 ] --- createOsiSubProblem() ---> funcT = 0.062 D-ALGO : 2.21 [CPU: 2.23 ] <--- createOsiSubProblem() --- D-ALGO : 2.26 [CPU: 2.277 ] --- createOsiSubProblem() ---> funcT = 0.047 D-ALGO : 2.31 [CPU: 2.32 ] <--- createOsiSubProblem() --- D-ALGO : 2.34 [CPU: 2.355 ] --- createOsiSubProblem() ---> funcT = 0.031 D-ALGO : 2.39 [CPU: 2.4 ] <--- createOsiSubProblem() --- D-ALGO : 2.43 [CPU: 2.449 ] --- createOsiSubProblem() ---> funcT = 0.047 Number of Convexity Constraints: 9 ModelRelax cols: 61 rows: 21 ModelRelax cols: 61 rows: 21 ModelRelax cols: 61 rows: 21 ModelRelax cols: 61 rows: 21 D-ALGO : 2.56 [CPU: 2.57 ] <--- generateInitVars() ------ D-APP : 2.59 [CPU: 2.61 ] <--- generateInitVars() ------ D-APP : 2.62 [CPU: 2.636 ] --- generateInitVars() ------> funcT = 0.031 D-ALGO : 2.67 [CPU: 2.68 ] <--- solveRelaxed() ---------- solve block b = 0 alpha = 9e+015 isNested = 0 CPLEX Error 3003: Not a mixed-integer problem. CPX0000 CPLEX Error 3003: Not a mixed-integer problem. Tried aggregator 2 times. CPX0000 Tried aggregator 2 times. MIP Presolve eliminated 7 rows and 51 columns. CPX0000 MIP Presolve eliminated 7 rows and 51 columns. Aggregator did 3 substitutions. CPX0000 Aggregator did 3 substitutions. Reduced MIP has 11 rows, 8 columns, and 39 nonzeros. CPX0000 Reduced MIP has 11 rows, 8 columns, and 39 nonzeros. Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. CPX0000 Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. Presolve time = 0.03 sec. CPX0000 Presolve time = 0.03 sec. Found feasible solution after 0.03 sec. Objective = 1365.0000 CPX0000 Found feasible solution after 0.03 sec. Objective = 1365.0000 Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Clique table members: 1. CPX0000 Clique table members: 1. MIP emphasis: balance optimality and feasibility. CPX0000 MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. CPX0000 MIP search method: dynamic search. Parallel mode: none, using 1 thread. CPX0000 Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. CPX0000 Root relaxation solution time = 0.00 sec. Nodes Cuts/ CPX0000 CPX0000 Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 * 0+ 0 1365.0000 6 --- CPX0000 * 0+ 0 1365.0000 6 --- * 0 0 integral 0 150.0000 150.0000 6 0.00% CPX0000 * 0 0 integral 0 150.0000 150.0000 6 0.00% Elapsed real time = 0.09 sec. (tree size = 0.00 MBCPX0000 Elapsed real time = , solutions = 2CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MB ) CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MCPX0000 , solutions = 2 Number of solutions in solution pool = 2 Sol 0: Obj: 150 solStatus = 101 alpha = 9e+015 varRedCost = -9e+015 varOrigCost = 150 D-ALGO : 2.89 [CPU: 2.901 ] --- solveRelaxed() ----------> funcT = 0.218 ThisLB = 150, sumInitLB = 150 D-ALGO : 2.93 [CPU: 2.95 ] <--- solveRelaxed() ---------- solve block b = 1 alpha = 9e+015 isNested = 0 CPLEX Error 3003: Not a mixed-integer problem. CPX0000 CPLEX Error 3003: Not a mixed-integer problem. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. MIP Presolve eliminated 14 rows and 56 columns. CPX0000 MIP Presolve eliminated 14 rows and 56 columns. Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. CPX0000 Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. CPX0000 Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. Presolve time = 0.03 sec. CPX0000 Presolve time = 0.03 sec. Found feasible solution after 0.03 sec. Objective = 0.0000 CPX0000 Found feasible solution after 0.03 sec. Objective = 0.0000 Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Clique table members: 1. CPX0000 Clique table members: 1. MIP emphasis: balance optimality and feasibility. CPX0000 MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. CPX0000 MIP search method: dynamic search. Parallel mode: none, using 1 thread. CPX0000 Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. CPX0000 Root relaxation solution time = 0.00 sec. Nodes Cuts/ CPX0000 CPX0000 Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 * 0+ 0 0.0000 1 --- CPX0000 * 0+ 0 0.0000 1 --- 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% Elapsed real time = 0.09 sec. (tree size = 0.00 MBCPX0000 Elapsed real time = , solutions = 1CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MB ) CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MCPX0000 , solutions = 1 Number of solutions in solution pool = 1 Sol 0: Obj: 0 solStatus = 101 alpha = 9e+015 varRedCost = -9e+015 varOrigCost = 0 D-ALGO : 3.13 [CPU: 3.151 ] --- solveRelaxed() ----------> funcT = 0.203 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.17 [CPU: 3.18 ] <--- solveRelaxed() ---------- solve block b = 2 alpha = 9e+015 isNested = 0 CPLEX Error 3003: Not a mixed-integer problem. CPX0000 CPLEX Error 3003: Not a mixed-integer problem. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. MIP Presolve eliminated 14 rows and 56 columns. CPX0000 MIP Presolve eliminated 14 rows and 56 columns. Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. CPX0000 Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. CPX0000 Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. Presolve time = 0.03 sec. CPX0000 Presolve time = 0.03 sec. Found feasible solution after 0.03 sec. Objective = 0.0000 CPX0000 Found feasible solution after 0.03 sec. Objective = 0.0000 Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Clique table members: 1. CPX0000 Clique table members: 1. MIP emphasis: balance optimality and feasibility. CPX0000 MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. CPX0000 MIP search method: dynamic search. Parallel mode: none, using 1 thread. CPX0000 Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. CPX0000 Root relaxation solution time = 0.00 sec. Nodes Cuts/ CPX0000 CPX0000 Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 * 0+ 0 0.0000 1 --- CPX0000 * 0+ 0 0.0000 1 --- 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% Elapsed real time = 0.09 sec. (tree size = 0.00 MBCPX0000 Elapsed real time = , solutions = 1CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MB ) CPX0000 Elapsed real time CPX0000 0.09 sec. (tree size = 0.00 MCPX0000 , solutions = 1 Number of solutions in solution pool = 1 Sol 0: Obj: 0 solStatus = 101 alpha = 9e+015 varRedCost = -9e+015 varOrigCost = 0 D-ALGO : 3.35 [CPU: 3.369 ] --- solveRelaxed() ----------> funcT = 0.187 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.38 [CPU: 3.4 ] <--- solveRelaxed() ---------- solve block b = 3 alpha = 9e+015 isNested = 0 CPLEX Error 3003: Not a mixed-integer problem. CPX0000 CPLEX Error 3003: Not a mixed-integer problem. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. MIP Presolve eliminated 14 rows and 56 columns. CPX0000 MIP Presolve eliminated 14 rows and 56 columns. Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. CPX0000 Reduced MIP has 7 rows, 6 columns, and 21 nonzeros. Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. CPX0000 Reduced MIP has 3 binaries, 0 generals, 0 SOSs, and 0 indicators. Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. Presolve time = 0.02 sec. CPX0000 Presolve time = 0.02 sec. Found feasible solution after 0.03 sec. Objective = 0.0000 CPX0000 Found feasible solution after 0.03 sec. Objective = 0.0000 Probing time = 0.00 sec. CPX0000 Probing time = 0.00 sec. Clique table members: 1. CPX0000 Clique table members: 1. MIP emphasis: balance optimality and feasibility. CPX0000 MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. CPX0000 MIP search method: dynamic search. Parallel mode: none, using 1 thread. CPX0000 Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. CPX0000 Root relaxation solution time = 0.00 sec. Nodes Cuts/ CPX0000 CPX0000 Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 Node Left Objective IInf Best Integer Best Node ItCnt Gap CPX0000 * 0+ 0 0.0000 1 --- CPX0000 * 0+ 0 0.0000 1 --- 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% 0 0 cutoff 0.0000 0.0000 1 0.00% CPX0000 0 0 cutoff 0.0000 0.0000 1 0.00% Elapsed real time = 0.08 sec. (tree size = 0.00 MBCPX0000 Elapsed real time = , solutions = 1CPX0000 Elapsed real time CPX0000 0.08 sec. (tree size = 0.00 MB ) CPX0000 Elapsed real time CPX0000 0.08 sec. (tree size = 0.00 MCPX0000 , solutions = 1 Number of solutions in solution pool = 1 Sol 0: Obj: 0 solStatus = 101 alpha = 9e+015 varRedCost = -9e+015 varOrigCost = 0 D-ALGO : 3.56 [CPU: 3.572 ] --- solveRelaxed() ----------> funcT = 0.172 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.59 [CPU: 3.6 ] <--- solveRelaxed() ---------- solve block b = 4 alpha = 9e+015 isNested = 0 D-ALGO : 3.63 [CPU: 3.65 ] --- solveRelaxed() ----------> funcT = 0.047 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.67 [CPU: 3.68 ] <--- solveRelaxed() ---------- solve block b = 5 alpha = 9e+015 isNested = 0 D-ALGO : 3.7 [CPU: 3.712 ] --- solveRelaxed() ----------> funcT = 0.031 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.73 [CPU: 3.74 ] <--- solveRelaxed() ---------- solve block b = 6 alpha = 9e+015 isNested = 0 D-ALGO : 3.77 [CPU: 3.79 ] --- solveRelaxed() ----------> funcT = 0.046 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.81 [CPU: 3.82 ] <--- solveRelaxed() ---------- solve block b = 7 alpha = 9e+015 isNested = 0 D-ALGO : 3.85 [CPU: 3.868 ] --- solveRelaxed() ----------> funcT = 0.046 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.88 [CPU: 3.9 ] <--- solveRelaxed() ---------- solve block b = 8 alpha = 9e+015 isNested = 0 D-ALGO : 3.93 [CPU: 3.946 ] --- solveRelaxed() ----------> funcT = 0.046 ThisLB = 0, sumInitLB = 150 D-ALGO : 3.96 [CPU: 3.978 ] --- generateInitVars() ------> funcT = 1.4 D-ALGO : 3.99 [CPU: 4.01 ] <--- createMasterProblem() --- D-ALGO : 4.06 [CPU: 4.071 ] --- createMasterProblem() ---> funcT = 0.062 Model core nCols= 61 nRows = 70 D-ALGO : 4.09 [CPU: 4.1 ] <--- loadSIFromModel() ------- D-ALGO : 4.13 [CPU: 4.149 ] --- loadSIFromModel() -------> funcT = 0.047 D-ALGO : 4.15 [CPU: 4.165 ] --- initSetup() -------------> funcT = 3.65 Alps0300I ALPS version 1.1 (Serial) Alps0250I Search solutions ... D-ALGO : 4.18 [CPU: 4.2 ] <--- setMasterBounds() ------- D-ALGO : 4.2 [CPU: 4.212 ] --- setMasterBounds() -------> funcT = 0.016 New Global UB = INF D-ALGO : 4.24 [CPU: 4.26 ] <--- processNode() ----------- Process Node 0 (algo = PRICE_AND_CUT, phaseLast = PHASE_UNKNOWN) gLB = -INF gUB = INF gap = INF time = 4.259 D-ALGOPC : 4.29 [CPU: 4.3 ] <--- phaseInit() ------------- D-ALGOPC : 4.32 [CPU: 4.336 ] --- phaseInit() -------------> funcT = 0.031 D-ALGO : 4.35 [CPU: 4.37 ] <--- solutionUpdate() -------- Tried aggregator 1 time. CPX0000 Tried aggregator 1 time. LP Presolve eliminated 43 rows and 53 columns. CPX0000 LP Presolve eliminated 43 rows and 53 columns. Reduced LP has 36 rows, 44 columns, and 76 nonzeros. CPX0000 Reduced LP has 36 rows, 44 columns, and 76 nonzeros. Presolve time = 0.02 sec. CPX0000 Presolve time = 0.02 sec. Parallel mode: using up to 2 threads for barrier. CPX0000 Parallel mode: using up to 2 threads for barrier. Number of nonzeros in lower triangle of A*A'CPX0000 Number of nonzeros in lower triangle of = 144 CPX0000 Number of nonzeros in lower triangle oCPX0000 A*A' Using Approximate Minimum Degree ordering CPX0000 Using Approximate Minimum Degree ordering Total time for automaticCPX0000 Total time for ordering = 0.00 sec. CPX0000 Total time foCPX0000 automatic Summary statistics for Cholesky factor: CPX0000 Summary statistics for Cholesky factor: Threads = 2 CPX0000 Threads = 2 Rows in Factor = 36 CPX0000 Rows in Factor = 36 Integer space required = 36 CPX0000 Integer space required = 36 Total non-zeros in factor = 180 CPX0000 Total non-zeros in factor = 180 Total FP ops to factor = 1140 CPX0000 Total FP ops to factor = 1140 Itn Primal Obj Dual Obj Prim Inf Upper Inf Dual Inf CPX0000 Itn Primal Obj Dual Obj Prim Inf Upper Inf Dual Inf 0 1.2727273e+021 4.0000000e+000 1.75e+021 0.00e+000 1.12e+002 CPX0000 0 1.2727273e+021 4.0000000e+000 1.75e+021 0.00e+000 1.12e+002 1 5.9609448e+020 5.6913266e+020 3.93e+005 0.00e+000 1.99e+001 CPX0000 1 5.9609448e+020 5.6913266e+020 3.93e+005 0.00e+000 1.99e+001 Barrier limit on dual objective exceeded. CPX0000 Barrier limit on dual objective exceeded. Infeasible barrier solution (dependent on objective limit). CPX0000 Infeasible barrier solution (dependent on objective limit). Total real time on 2 threads = 0.09 sec. CPX0000 CPX0000 Total real time on 2 threads = 0.09 sec. Solution update n_cols:97 n_rows: 79 n_iter: 0 time: 0.109 Iteration Count : 0 isAbandoned() : 0 isProvenOptimal() : 0 isProvenPrimalInfeasible() : 0 isProvenDualInfeasible() : 0 isPrimalObjectiveLimitReached : 0 isDualObjectiveLimitReached : 0 isIterationLimitReached : 0 Assertion failed: 0, file ..\..\..\..\src\DecompAlgo.cpp, line 2434 c:\Users\s001287\Documents\project\Dip-0.8.7\Dip\MSVisualStudio\v9\DecompExamples\Debug>