private void AddBinaryConstraint() { foreach (var col in colBinary) { double[] newRow = new double[linearProgram.ColumnCount + 1]; newRow[col] = 1; newRow[linearProgram.ColumnCount - 1] = 1; newRow[linearProgram.ColumnCount] = 1; linearProgram.LinearProgramMatrix = LpTools.AddRow(newRow, linearProgram); linearProgram.CountS++; } }
public LinearProgram Solve() { int targetRow = 0; double fractionDifferance = 1; for (int c = 1; c < linearProgram.CountX + 1; c++) { for (int r = 1; r < linearProgram.RowCount; r++) { double currentCell = linearProgram.LinearProgramMatrix[r, c]; double currentValue = linearProgram.LinearProgramMatrix[r, linearProgram.ColumnCount - 1]; if (currentCell != 0 && currentCell != 1) { break; } if (currentCell == 1) { double thisFraction = Math.Abs(currentValue) - (int)Math.Abs(currentValue); double tempDiff = Math.Abs(0.5 - thisFraction); if (tempDiff < fractionDifferance) { targetRow = r; fractionDifferance = tempDiff; } } } } if (fractionDifferance == 1) { return(linearProgram); } double[] fractionArray = new double[linearProgram.ColumnCount + 1]; for (int i = 0; i < linearProgram.ColumnCount; i++) { fractionArray[i] = linearProgram.LinearProgramMatrix[targetRow, i]; if (fractionArray[i] % 1 == 0) { fractionArray[i] = 0; } else if (fractionArray[i] > 0) { fractionArray[i] -= (int)fractionArray[i]; } else { fractionArray[i] += (((int)fractionArray[i] * -1) + 1); } fractionArray[i] = Math.Round(fractionArray[i], 9); fractionArray[i] *= -1; } fractionArray[fractionArray.Length - 1] = fractionArray[fractionArray.Length - 2]; fractionArray[fractionArray.Length - 2] = 1; linearProgram.LinearProgramMatrix = LpTools.AddRow(fractionArray, linearProgram); linearProgram.CountS++; Dual dual = new Dual(linearProgram); LinearProgram solvedLp = dual.Solve(); while (!LpTools.CheckIfIPIsSolved(solvedLp, true)) { if (LpTools.IsSpecialCase(solvedLp)) { return(solvedLp); } solvedLp = new CuttingPlane(solvedLp).Solve(); } return(solvedLp); }