Hosil qilingan tenglamalar sistemasini vektor shaklida yozamiz:
C++ dagi ko’rinishi : #include #include #include using namespace std;class Simplex{ private: int rows, cols; //stores coefficients of all the variables std::vector > A; //stores constants of constraints std::vector B; //stores the coefficients of the objective function std::vector C; float maximum; bool isUnbounded; public: Simplex(std::vector > matrix,std::vector b ,std::vector c){ maximum = 0; isUnbounded = false; rows = matrix.size(); cols = matrix[0].size(); A.resize( rows , vector( cols , 0 ) ); B.resize(b.size()); C.resize(c.size()); for(int i= 0;i= 0){ positveValueCount++; } } //if all the constraints are positive now,the table is optimal if(positveValueCount == C.size()){ isOptimal = true; print(); } return isOptimal; } void doPivotting(int pivotRow, int pivotColumn){ float pivetValue = A[pivotRow][pivotColumn];//gets the pivot value float pivotRowVals[cols];//the column with the pivot float pivotColVals[rows];//the row with the pivot float rowNew[cols];//the row after processing the pivot value maximum = maximum - (C[pivotColumn]*(B[pivotRow]/pivetValue)); //set the maximum step by step //get the row that has the pivot value for(int i=0;i
