The Terminal Assignment ProblemProblem description• Given n terminals and m concentrators.• Task: connect each terminal to a concentrator, so that the connectioncost is minimized.• The cost of connecting terminal i to concentrator j is cij.• Each concentrator can accomodate at most q terminals.Formulation as a mathematical programLet us introduce variables:xij=1 if terminal i is connected to concentrator j0 otherwiseThe objective is minimizing the total cost:min Z =nXi=1mXj=1cijxijConstraints:Each terminal is connected to exactly one concentrator:mXj=1xij= 1 (∀i)Each concentrator can accomodate at most q terminals:nXi=1xij≤ q (∀j)Summarizing, the mathematical program is:min Z =nXi=1mXj=1cijxijSubject tomXj=1xij= 1 (∀i)nXi=1xij≤ q (∀j)xij∈ {0, 1} (∀i,
View Full Document