diff --git a/src/data_placement_engine.cc b/src/data_placement_engine.cc
index 54295b0f1..5a0a8c524 100644
--- a/src/data_placement_engine.cc
+++ b/src/data_placement_engine.cc
@@ -322,26 +322,26 @@ Status MinimizeIoTimePlacement(const std::vector<size_t> &blob_sizes,
   }
 
   // Placement Ratio
-  for (size_t j {0}; j < num_targets-1; ++j) {
-    blob_constrt[num_constrts+j] =
-      solver.MakeRowConstraint(0, solver.infinity());
-    for (size_t i {0}; i < num_blobs; ++i) {
-      blob_constrt[num_constrts+j]->SetCoefficient(
-        blob_fraction[i][j+1], static_cast<double>(blob_sizes[i]));
-      double placement_ratio = static_cast<double>(node_state[j+1])/
-                                                   node_state[j];
-      blob_constrt[num_constrts+j]->SetCoefficient(
-        blob_fraction[i][j],
-        static_cast<double>(blob_sizes[i])*(0-placement_ratio));
-    }
-  }
+  // for (size_t j {0}; j < num_targets-1; ++j) {
+  //   blob_constrt[num_constrts+j] =
+  //     solver.MakeRowConstraint(0, solver.infinity());
+  //   for (size_t i {0}; i < num_blobs; ++i) {
+  //     blob_constrt[num_constrts+j]->SetCoefficient(
+  //       blob_fraction[i][j+1], static_cast<double>(blob_sizes[i]));
+  //     double placement_ratio = static_cast<double>(node_state[j+1])/
+  //                                                  node_state[j];
+  //     blob_constrt[num_constrts+j]->SetCoefficient(
+  //       blob_fraction[i][j],
+  //       static_cast<double>(blob_sizes[i])*(0-placement_ratio));
+  //   }
+  // }
 
   // Objective to minimize IO time
   MPObjective* const objective = solver.MutableObjective();
   for (size_t i {0}; i < num_blobs; ++i) {
     for (size_t j {0}; j < num_targets; ++j) {
       objective->SetCoefficient(blob_fraction[i][j],
-        static_cast<double>(blob_sizes[i])/bandwidths[j]);
+        static_cast<double>(blob_sizes[i]) * bandwidths[j]);
     }
   }
   objective->SetMinimization();