iteration_num: 1
solve_status: OPTIMAL
objective_value= -311830.0506800078
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -311752.0132729597
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -311750.2026156968
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -311750.0673325939
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -311749.87648508366
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -311749.875390484
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -311749.83702366165
End No. 12iteration
END
