adjusting logs

Author: nguidotti

cpp/src/dual_simplex/basis_solves.cpp

@@ -362,7 +362,7 @@ i_t factorize_basis(const csc_matrix_t<i_t, f_t>& A,
                                  SU,
                                  S_perm_inv);
         if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-          settings.log.printf("Concurrent halt\n");
+          if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
           return -1;
         }
         if (Srank != Sdim) {
@@ -581,7 +581,7 @@ i_t factorize_basis(const csc_matrix_t<i_t, f_t>& A,
     }
   }
   if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-    settings.log.printf("Concurrent halt\n");
+    if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
     return -1;
   }
   if (verbose) {

cpp/src/dual_simplex/crossover.cpp

@@ -534,7 +534,7 @@ i_t dual_push(const lp_problem_t<i_t, f_t>& lp,
       return -1;
     }
     if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-      settings.log.printf("Concurrent halt\n");
+      if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
       return -2;
     }
   }
@@ -832,7 +832,7 @@ i_t primal_push(const lp_problem_t<i_t, f_t>& lp,
       return -1;
     }
     if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-      settings.log.printf("Concurrent halt\n");
+      if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
       return -2;
     }
   }
@@ -1163,7 +1163,7 @@ crossover_status_t crossover(const lp_problem_t<i_t, f_t>& lp,
     return crossover_status_t::TIME_LIMIT;
   }
   if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-    settings.log.printf("Concurrent halt\n");
+    if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
     return crossover_status_t::CONCURRENT_LIMIT;
   }
 
@@ -1250,7 +1250,7 @@ crossover_status_t crossover(const lp_problem_t<i_t, f_t>& lp,
       return crossover_status_t::TIME_LIMIT;
     }
     if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-      settings.log.printf("Concurrent halt\n");
+      if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
       return crossover_status_t::CONCURRENT_LIMIT;
     }
     primal_infeas = primal_infeasibility(lp, settings, vstatus, solution.x);
@@ -1386,7 +1386,7 @@ crossover_status_t crossover(const lp_problem_t<i_t, f_t>& lp,
         return crossover_status_t::TIME_LIMIT;
       }
       if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-        settings.log.printf("Concurrent halt\n");
+        if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
         return crossover_status_t::CONCURRENT_LIMIT;
       }
       solution.iterations += iter;

cpp/src/dual_simplex/right_looking_lu.cpp

@@ -1,6 +1,6 @@
 /* clang-format off */
 /*
- * SPDX-FileCopyrightText: Copyright (c) 2025, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
+ * SPDX-FileCopyrightText: Copyright (c) 2025-2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
  * SPDX-License-Identifier: Apache-2.0
  */
 /* clang-format on */
@@ -1114,7 +1114,7 @@ i_t right_looking_lu_row_permutation_only(const csc_matrix_t<i_t, f_t>& A,
     }
 
     if (settings.concurrent_halt != nullptr && *settings.concurrent_halt == 1) {
-      settings.log.printf("Concurrent halt\n");
+      if (!settings.inside_mip) { settings.log.printf("Concurrent halt\n"); }
       return -2;
     }
   }