iteration_num: 1
solve_status: OPTIMAL
objective_value= -311822.61369088833
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -311603.91047015483
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -311602.33236125053
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -311601.8286550884
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -311601.38357793726
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -311601.3792633157
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -311601.2401700975
End No. 12iteration
END
