iteration_num: 1
solve_status: OPTIMAL
objective_value= -267250.3932063076
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -267193.68220602814
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -267192.9753516898
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -267192.912249992
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -267192.84049313486
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -267192.84047455346
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -267192.8289306594
End No. 12iteration
END
