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: sambalG.CDL Box data file name is: sambal.DT1 Initial box: [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 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 ------------------------------------------------ ------------------------------------------------ ------------------------------------------------ Completion of run_solution_by_discretization. Total CPU time: 0.10000600000000000 MAX_SUBDIVISIONS: 1 BEST_ESTIMATE: 64967551.980896510 FEASIBILITY_VERIFICATION_SUCCEEDED: F N_FEASIBILITY_VERIFICATION_FAILED: 1 EFFECTIVE_EPSILON: 2.22507385850720287E-308 EPSILON_PHI: 64967551.980896525 LP_SOLUTION_FAILED: F Solution boxes: ------------------------------------------------ Solution box number: 1 with overall box index: 1 [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ], [ -0.100E+05, 0.100E+05 ] [ -0.100E+05, 0.100E+05 ] LP solution: 8.79 , -3.09 , 143. , 79.9 , 8.79 , 158. 15.0 , 15.7 , 39.9 , 39.3 , 228. , 182. 94.9 , 33.3 , 195. , 33.3 , 195. LP solution possibly adjusted with a point optimizer: 8.79 , -3.09 , 143. , 79.9 , 8.79 , 158. 15.0 , 15.7 , 39.9 , 39.3 , 228. , 182. 94.9 , 33.3 , 195. , 33.3 , 195. Objective bounds over the solution box: [ -0.289-306, 0.650E+08 ] 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 ], [ 0.00 , 0.00 ] [ 0.00 , 0.00 ], [ 0.00 , 0.00 ] ------------------------------------------------ No. dense interval residual evaluations -- gradient code list: 1 Number of solutions for a component in the expanded system: 206 Total number of forward_substitutions: 4 Number point dense residual evaluations, gradient codelist: 11 Total number dense interval constraint evaluations: 40 Total number dense interval constraint gradient component evaluations: 170 Total number dense point constraint gradient component evaluations: 2040 Total time spent searching for "D" in the LP filter: 0.400E-01 Number of times SUBSIT decreased one or more coordinate widths: 2