Improve column generation feasibility info

Author: fontanf

include/columngenerationsolver/algorithms/column_generation.hpp

@@ -17,6 +17,8 @@ struct ColumnGenerationOutput: Output
     /** Value of the relaxation solution (with dummy columns). */
     double relaxation_solution_value = 0.0;
 
+    bool feasible = false;
+
     /** Number of columns in the linear subproblem. */
     ColIdx number_of_columns_in_linear_subproblem = 0;
 

src/algorithms/column_generation.cpp

@@ -820,6 +820,7 @@ const ColumnGenerationOutput columngenerationsolver::column_generation(
 
         // If the final solution doesn't contain any dummy column, then stop.
         if (!has_dummy_column) {
+            output.feasible = true;
             output.relaxation_solution = solution_builder.build();
             break;
         }

src/algorithms/greedy.cpp

@@ -90,7 +90,7 @@ const GreedyOutput columngenerationsolver::greedy(
         if (parameters.timer.needs_to_end())
             break;
 
-        if (!cg_output.relaxation_solution.feasible_relaxation())
+        if (!cg_output.feasible)
             break;
 
         // Update bound.

src/algorithms/limited_discrepancy_search.cpp

@@ -237,7 +237,7 @@ const LimitedDiscrepancySearchOutput columngenerationsolver::limited_discrepancy
                 algorithm_formatter.update_bound(cg_output.bound);
                 output.relaxation_solution = cg_output.relaxation_solution;
             }
-            if (!cg_output.relaxation_solution.feasible_relaxation()) {
+            if (!cg_output.feasible) {
                 //std::cout << "no solution" << std::endl;
                 continue;
             }