MIDACO 6.0 (www.midaco-solver.com) ---------------------------------- LICENSE-KEY: MIDACO_LIMITED_VERSION___[CREATIVE_COMMONS_BY-NC-ND_LICENSE] ---------------------------------------- | OBJECTIVES 3 | PARALLEL 1 | |--------------------------------------| | N 3 | MAXEVAL 1000000 | | NI 0 | MAXTIME 86400 | | M 0 | PRINTEVAL 100000 | | ME 0 | SAVE2FILE 1 | |--------------------------------------| | PARAM[ 9] 1.0000000e+04 PARETOMAX | ---------------------------------------- [ EVAL, TIME] MULTI-OBJECTIVE PROGRESS VIOLATION OF G(X) ------------------------------------------------------------------- [PARETO] [ 1, 0] PRO: 1.00037493 VIO: 0.000000 [ 1] [ 100000, 2] PRO: -8.49157262 VIO: 0.000000 [ 1002] [ 200000, 4] PRO: -8.49157262 VIO: 0.000000 [ 1700] [ 300000, 7] PRO: -8.49157262 VIO: 0.000000 [ 1990] [ 400000, 10] PRO: -8.49157262 VIO: 0.000000 [ 2143] [ 500000, 13] PRO: -8.49157262 VIO: 0.000000 [ 2249] [ 600000, 16] PRO: -8.49157262 VIO: 0.000000 [ 2341] [ 700000, 19] PRO: -8.49157262 VIO: 0.000000 [ 2401] [ 800000, 22] PRO: -8.49157262 VIO: 0.000000 [ 2439] [ 900000, 25] PRO: -8.49157262 VIO: 0.000000 [ 2482] [ 1000000, 28] PRO: -8.49157262 VIO: 0.000000 [ 2518] OPTIMIZATION FINISHED ---> MAXEVAL REACHED BEST SOLUTION FOUND BY MIDACO -------------------------------------------- EVAL: 1000000, TIME: 28.00, IFLAG: 1 -------------------------------------------- PROGRESS -8.491572616281100 -------------------------------------------- NUMBER OF PARETO POINTS 2518 -------------------------------------------- f[ 0] = 0.570283293616926 f[ 1] = 0.584687419072789 f[ 2] = 0.576990109966741 -------------------------------------------- x[ 0] = 0.615038674265122; # ________x____________ x[ 1] = 0.012493937399790; # __________x__________ x[ 2] = 0.000000000000000; # XL___________________