iteration_num: 1
solve_status: OPTIMAL
objective_value= -311826.25816137885
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -311674.44363852666
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -311672.6201468402
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -311672.34966463473
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -311671.97713220265
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -311671.9744516855
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -311671.8843029647
End No. 12iteration
END
