Merge pull request #1497 from guifcoelho/fix/branch_and_price_prune_n…

…ode_when_rmp_is_feasible Issue 1496
ERGO-Code · Nov 10, 2023 · 806a56a · 806a56a
2 parents 58e8254 + 913fe6d
commit 806a56a
Showing 1 changed file with 2 additions and 5 deletions.
diff --git a/examples/branch-and-price.py b/examples/branch-and-price.py
@@ -366,12 +366,9 @@ def branchAndPrice(m, vals, columns, start_time=0):
         mp_is_feasible, m, node = solveNode(node, columns, m)
         count_nodes_visited += 1
 
-        # Prune nodes that cannot lead to optimal solution        
-        if node.value >= best_obj:
-            continue
-
         # Only add columns if the master problem is feasible
-        if mp_is_feasible:
+        # Prune nodes that cannot lead to optimal solution        
+        if mp_is_feasible and node.value < best_obj:
             columns = node.final_columns            
             count_fractional_columns = len(node.final_fractional_columns)