[GLOP] remove dead code

ortools/glop/lu_factorization.cc

@@ -565,20 +565,6 @@ Fractional LuFactorization::ComputeInverseInfinityNormUpperBound() const {
          upper_.ComputeInverseInfinityNormUpperBound();
 }
 
-namespace {
-// Returns the density of the sparse column 'b' w.r.t. the given permutation.
-double ComputeDensity(const SparseColumn& b, const RowPermutation& row_perm) {
-  double density = 0.0;
-  for (const SparseColumn::Entry e : b) {
-    if (row_perm[e.row()] != kNonPivotal && e.coefficient() != 0.0) {
-      ++density;
-    }
-  }
-  const RowIndex num_rows = row_perm.size();
-  return density / num_rows.value();
-}
-}  // anonymous namespace
-
 void LuFactorization::ComputeTransposeUpper() {
   SCOPED_TIME_STAT(&stats_);
   transpose_upper_.PopulateFromTranspose(upper_);

ortools/glop/preprocessor.cc

@@ -44,11 +44,6 @@ namespace glop {
 using ::util::Reverse;
 
 namespace {
-// Returns an interval as an human readable string for debugging.
-std::string IntervalString(Fractional lb, Fractional ub) {
-  return absl::StrFormat("[%g, %g]", lb, ub);
-}
-
 #if defined(_MSC_VER)
 double trunc(double d) { return d > 0 ? floor(d) : ceil(d); }
 #endif

ortools/glop/primal_edge_norms.h

@@ -203,7 +203,6 @@ class PrimalEdgeNorms {
   Stats stats_;
 
   // Booleans to control what happens on the next ChooseEnteringColumn() call.
-  bool must_refactorize_basis_;
   bool recompute_edge_squared_norms_;
   bool reset_devex_weights_;
 

ortools/glop/update_row.h

@@ -145,7 +145,6 @@ class UpdateRow {
   DenseRow coefficient_;
 
   // Boolean used to avoid recomputing many times the same thing.
-  bool compute_update_row_;
   RowIndex left_inverse_computed_for_ = kInvalidRow;
   RowIndex update_row_computed_for_ = kInvalidRow;