iteration_num: 1
solve_status: OPTIMAL
objective_value= -267227.989780527
End No. 1iteration
iteration_num: 2
solve_status: OPTIMAL
objective_value= -266739.48434406257
End No. 2iteration
iteration_num: 3
solve_status: OPTIMAL
objective_value= -266383.8113329431
End No. 3iteration
iteration_num: 4
solve_status: OPTIMAL
objective_value= -266383.1582607613
End No. 4iteration
iteration_num: 5
solve_status: OPTIMAL
objective_value= -266382.1064055999
End No. 5iteration
iteration_num: 6
solve_status: OPTIMAL
objective_value= -266382.04799060815
End No. 6iteration
iteration_num: 7
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 7iteration
iteration_num: 8
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 8iteration
iteration_num: 9
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 9iteration
iteration_num: 10
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 10iteration
iteration_num: 11
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 11iteration
iteration_num: 12
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 12iteration
iteration_num: 13
solve_status: OPTIMAL
objective_value= -266381.8752809141
End No. 13iteration
END
