iteration_num: 1
solve_status: OPTIMAL
objective_value= -267247.75104705524
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -267130.5783383279
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -267128.8047707955
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -267128.6396903896
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -267128.3961495897
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -267128.39608213905
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -267128.36600971414
End No. 12iteration
END
