iteration_num: 1
solve_status: OPTIMAL
objective_value= -311797.8874566141
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -311166.9185549486
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -310674.8808769086
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -310673.1667216526
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -310670.7703802225
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -310670.75571028213
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -310669.5990331309
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 12iteration
iteration_num: 13
solve_status: OPTIMAL
objective_value= -310669.59903312963
End No. 13iteration
END
