From d60c415399134907d518cd60482f1d9bd1deaea2 Mon Sep 17 00:00:00 2001 From: Andrade_Tiago Date: Thu, 14 Jun 2018 12:34:27 -0300 Subject: [PATCH 1/2] correcting best bound for mip problems and relative gaps for negative solutions --- src/MathOptInterfaceXpress.jl | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/MathOptInterfaceXpress.jl b/src/MathOptInterfaceXpress.jl index 3f0408f..83b791b 100644 --- a/src/MathOptInterfaceXpress.jl +++ b/src/MathOptInterfaceXpress.jl @@ -509,12 +509,12 @@ end LQOI.get_objective_value(instance::XpressOptimizer) = XPR.get_objval(instance.inner) -LQOI.get_objective_bound(instance::XpressOptimizer) = XPR.get_mip_objval(instance.inner) +LQOI.get_objective_bound(instance::XpressOptimizer) = XPR.get_bestbound(instance.inner) function LQOI.get_relative_mip_gap(instance::XpressOptimizer) - L = XPR.get_mip_objval(instance.inner) - U = XPR.get_bestbound(instance.inner) - return abs(U-L)/U + best_feasible_solution = XPR.get_mip_objval(instance.inner) + best_prossible_solution = XPR.get_bestbound(instance.inner) + return abs((Ubest_prossible_solution-best_feasible_solution)/best_prossible_solution) end LQOI.get_iteration_count(instance::XpressOptimizer) = XPR.get_simplex_iter_count(instance.inner) From a652e319ab75f83e3592f0caaea24e2515088145 Mon Sep 17 00:00:00 2001 From: Andrade_Tiago Date: Thu, 14 Jun 2018 12:36:06 -0300 Subject: [PATCH 2/2] correcting best bound for mip problems and relative gaps for negative solutions --- src/MathOptInterfaceXpress.jl | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/MathOptInterfaceXpress.jl b/src/MathOptInterfaceXpress.jl index 83b791b..f58a51a 100644 --- a/src/MathOptInterfaceXpress.jl +++ b/src/MathOptInterfaceXpress.jl @@ -513,8 +513,8 @@ LQOI.get_objective_bound(instance::XpressOptimizer) = XPR.get_bestbound(instance function LQOI.get_relative_mip_gap(instance::XpressOptimizer) best_feasible_solution = XPR.get_mip_objval(instance.inner) - best_prossible_solution = XPR.get_bestbound(instance.inner) - return abs((Ubest_prossible_solution-best_feasible_solution)/best_prossible_solution) + best_possible_solution = XPR.get_bestbound(instance.inner) + return abs((best_possible_solution-best_feasible_solution)/best_possible_solution) end LQOI.get_iteration_count(instance::XpressOptimizer) = XPR.get_simplex_iter_count(instance.inner)