iteration_num: 1
solve_status: OPTIMAL
objective_value= -361852.7993225598
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -361606.12703729596
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -361598.3064025014
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -361597.12227312033
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -361596.1446475096
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -361595.9693306674
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 12iteration
iteration_num: 13
solve_status: OPTIMAL
objective_value= -361595.840592414
End No. 13iteration
END
