--- Bonmin-1.8.7/src/CbcBonmin/Heuristics/BonHeuristicFPump.cpp.orig	2015-01-20 03:33:55.000000000 -0700
+++ Bonmin-1.8.7/src/CbcBonmin/Heuristics/BonHeuristicFPump.cpp	2019-06-20 10:35:57.915689913 -0600
@@ -529,7 +529,7 @@ namespace Bonmin
           if(indexColumnSelected < 0){//Looks like all variables have been fixed to 0
             continue;
           }
-	  assert(indexColumnSelected < jac_g.size());
+	  assert(indexColumnSelected < (int)jac_g.size());
 	  for (size_t j=0; j<jac_g.size(); j++) {
 	    int iColumn = jac_g[j].first;
 	    if((int)j == indexColumnSelected)
--- Bonmin-1.8.7/src/Interfaces/BonTMINLP2TNLP.cpp.orig	2015-01-20 03:33:55.000000000 -0700
+++ Bonmin-1.8.7/src/Interfaces/BonTMINLP2TNLP.cpp	2019-06-20 10:35:06.093616856 -0600
@@ -369,7 +369,7 @@ namespace Bonmin
 #endif
     if (init_x == true) {
       if(x_init_.empty()){
-        assert(x_init_user_.size() >= n);
+        assert((Index)x_init_user_.size() >= n);
         IpBlasDcopy(n, x_init_user_(), 1, x, 1);
       }
       else
@@ -378,7 +378,7 @@ namespace Bonmin
     if (init_z == true) {
       if(duals_init_ == NULL)
         return false;
-      assert(x_init_.size() == 3*n + m && duals_init_ == x_init_() + n); 
+      assert((Index)x_init_.size() == 3*n + m && duals_init_ == x_init_() + n); 
       IpBlasDcopy(n, duals_init_, 1, z_L, 1);
       IpBlasDcopy(n, duals_init_ + n, 1, z_U, 1);
 
@@ -386,7 +386,7 @@ namespace Bonmin
     if(init_lambda == true) {
       if(duals_init_ == NULL)
         return false;
-      assert(x_init_.size() == 3*n + m && duals_init_ == x_init_() + n); 
+      assert((Index)x_init_.size() == 3*n + m && duals_init_ == x_init_() + n); 
       if(m > 0)
         IpBlasDcopy(m, duals_init_ + 2*n , 1, lambda, 1);
     }
@@ -666,8 +666,8 @@ namespace Bonmin
 
   double
   TMINLP2TNLP::check_solution(OsiObject ** objects, int nObjects){
-    assert(x_sol_.size() == num_variables());
-    assert(g_sol_.size() == num_constraints());
+    assert((Index)x_sol_.size() == num_variables());
+    assert((Index)g_sol_.size() == num_constraints());
     if (objects) {
       for (int i = 0 ; i < nObjects ; i++) {
         OsiSimpleInteger * obj = dynamic_cast<OsiSimpleInteger *>(objects[i]);