iteration_num: 1
solve_status: OPTIMAL
objective_value= -267240.4209988653
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -266983.26357024047
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -266981.58947174146
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -266981.25262306444
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -266980.6774484267
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -266980.67705206835
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -266980.54617481935
End No. 12iteration
END
