In this issue, a decision that conditions Set Covering (SCP), we consider that the issue is characterized as a matrix of 0-1 with row i by {i = 1, 2, 3, ..., m}, and there is a column j by {j = 1, 2, 3, ..., n}, we define a variable X, in a decision that has a binary value Xj = 1 if the column j (which costs the Cj) selected Xj = 0 in other cases. Suppose we want to solve the decision needs a minimum (Minimization problem), we can write the function, purpose and terms in the mathematical equations are as follows:
การแปล กรุณารอสักครู่..
