iteration_num: 1
solve_status: OPTIMAL
objective_value= -275224.8277490989
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -272297.84860317956
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -270301.0729947785
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -270298.48672748223
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -270297.93670534727
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 12iteration
iteration_num: 13
solve_status: OPTIMAL
objective_value= -270297.81319824496
End No. 13iteration
END
