make abstract steps of simplex evaluation before elimination process

2024-09-21 20:22:36 +03:00
parent c7edcf8232
commit 3cba9318ef
3 changed files with 58 additions and 17 deletions
@@ -13,7 +13,29 @@ struct Result {
 	double objective_fucntion_value;
 };

-Result Simplex(ColumnVector C, Matrix A, ColumnVector b, double eps = 0.01, bool maximize) {
+Result Simplex(ColumnVector C, Matrix A, ColumnVector b, double eps = 0.01, bool maximize=true) {
+
+	std::cout << "C: " << C << std::endl;
+	std::cout << "A: " << A << std::endl;
+    std::cout << "b: " << b << std::endl;
+
+    int n = C.getRows();
+    int m = A.getColumns();
+
+	ColumnVector ratio_vector(m);
+
+	int pivot_column_index = 0;
+
+	pivot_column_index = max(C);
+
+	for (int i = 0; i < m; i++) {
+        ratio_vector[i] = b[i] / A[i][pivot_column_index];
+    }
+
+	int pivot_row_index = min(ratio_vector);
+
+	eleminate(A, C, b, pivot_column_index, pivot_row_index);
+	/*
 	Result result;
 	std::vector<int> basicVars(A.getColumns() - A.getRows());
 	basicVars[0] = -1;
@@ -43,7 +65,9 @@ Result Simplex(ColumnVector C, Matrix A, ColumnVector b, double eps = 0.01, bool
 			}
 		}
 		result.objective_fucntion_value = b[0];
+
 	}
+	*/
 }

 /*