Output from RUN_SOLUTION_BY_DISCRETIZATION on 05/08/2012 at 12:24:20. Version for the system is: March 13, 2009 Codelist file name is: harkerG.CDL Box data file name is: harker.DT1 Initial box: [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] Printing in overall algorithm: 0 Printing in LP: 0 EPS_LP_FIT: 1.00000000000000002E-002 ALLOW_EPSILON_APPROXIMATE: F USES_INTERMEDIATE_VARIABLES: F ------------------------------------------------ The independent minimal complete set is empty. The subspace dimension for the Kearfott / Hongthong 2005 analysis is zero. The problem is convex. MAX_SUBDIVISIONS: 1 Total number of sub-problems: 1 n_intermediate_bounds: 0 working indices: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ------------------------------------------------ ------------------------------------------------ ------------------------------------------------ Completion of run_solution_by_discretization. Total CPU time: 0.13600899999999999 MAX_SUBDIVISIONS: 1 BEST_ESTIMATE: 1916812795000.0046 FEASIBILITY_VERIFICATION_SUCCEEDED: F N_FEASIBILITY_VERIFICATION_FAILED: 1 EFFECTIVE_EPSILON: 2.22507385850720287E-308 EPSILON_PHI: 1916812796906.3857 LP_SOLUTION_FAILED: F Solution boxes: ------------------------------------------------ Solution box number: 1 with overall box index: 1 [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] [ 0.00 , 0.100E+05 ], [ 0.00 , 0.100E+05 ] LP solution: 10.7 , 0.00 , -0.00 , 0.245E-13, -0.00 , -0.00 10.7 , -0.00 , 0.245E-13, -0.245E-13, 10.7 , -0.00 -0.00 , -0.00 , 8.00 , 67.7 , 57.0 , 18.7 57.0 , 57.0 LP solution possibly adjusted with a point optimizer: 10.7 , 0.00 , -0.00 , 0.245E-13, -0.00 , -0.00 10.7 , -0.00 , 0.245E-13, -0.245E-13, 10.7 , -0.00 -0.00 , -0.00 , 8.00 , 67.7 , 57.0 , 18.7 57.0 , 57.0 Objective bounds over the solution box: [ -0.191E+04, 0.192E+13 ] Equality constraint bounds over the box: [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ] Inequality constraint bounds over the box: [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] [ -0.100E+05, 0.223-307 ], [ -0.100E+05, 0.223-307 ] ------------------------------------------------ No. dense interval residual evaluations -- gradient code list: 1 Number of solutions for a component in the expanded system: 388 Total number of forward_substitutions: 4 Number point dense residual evaluations, gradient codelist: 17 Total number dense interval constraint evaluations: 108 Total number dense interval constraint gradient component evaluations: 540 Total number dense point constraint gradient component evaluations: 9720 Total time spent searching for "D" in the LP filter: 0.480E-01 Number of times SUBSIT decreased one or more coordinate widths: 2