I am using Juniper in Julia/JuMP to solve a feasibility problem, whose constraints are linear. The FP iterations seem to be going on forever, having the difficulty in convergence. I am looking for help for a way to get the best feasible solution out of it.
My setting is below.
using Juniper
optimizer = Juniper.Optimizer
nl_solver= optimizer_with_attributes(Ipopt.Optimizer,"print_level" => 0)
mip_solver = optimizer_with_attributes(GLPK.Optimizer)
model = Model(optimizer_with_attributes(
optimizer, "nl_solver"=>nl_solver,
"mip_solver"=>mip_solver))
set_optimizer_attribute(model, "mip_gap", 0.0001)
set_time_limit_sec(model, 200)
set_optimizer_attribute(model, "branch_strategy", :StrongPseudoCost)
set_optimizer_attribute(model, "traverse_strategy", :DFS)
optimize!(model)
The .nl file is here
Juniper_problem1.nl.txt
The .lp file is here
Juniper_model1.lp.txt