diff --git a/src/positiveLinearCombination.js b/src/positiveLinearCombination.js
index ae19bf4c..40417836 100644
--- a/src/positiveLinearCombination.js
+++ b/src/positiveLinearCombination.js
@@ -13,7 +13,6 @@ function linearCombination(X) {
     for (let i = 0; i < X.columns - 1; i++) {
       tmp = vecVal - X.get(0, i);
       if (tmp >= 0 && X.get(0, i) > 0) {
-        console.table(solutions);
         solutions.set(0, i, solutions.get(0, i) + 1);
         vecVal = tmp;
         notTheEnd = true;
@@ -64,7 +63,6 @@ export function positiveLinearCombination(base, vector, options = {}) {
 
     let nA = new NNMF(A, 1, { maxIterations: NNMFmaxIterations, version: NNMFversion });
 
-    console.table(nA.X);
 
     for (let i = 0; i < m; i++) {
       if ((nA.X.get(m - 1, 0) / delta) > nA.X.get(i, 0)) {
@@ -72,21 +70,7 @@ export function positiveLinearCombination(base, vector, options = {}) {
       }
     }
 
-    console.table(nA.X);
-
     solutions = linearCombination(nA.X, nA.X.min() + Number.EPSILON);
     return (solutions);
   }
 }
-let base = new Matrix([
-  [0, 20, 100, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 30, 100, 30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 100, 5, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 100, 15, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0, 10, 100, 10, 0, 0, 0, 0, 0, 0, 0, 0],
-  [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 100, 10],
-]);
-let vector = new Matrix([[0, 20, 100, 20, 0, 0, 0, 0, 0, 5, 100, 5, 0, 0, 0, 20, 200, 20]]);
-let solutions = Matrix.zeros(1, base.columns);
-
-solutions = positiveLinearCombination(base, vector);