iteration_num: 1
solve_status: OPTIMAL
objective_value= -267245.2122443739
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -267078.1866088883
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -267076.8008320748
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -267076.58482416807
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -267076.21854567894
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -267076.21835526696
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -267076.14510138007
End No. 12iteration
END
