(The fixed charge net work design problem)
we are given a directed graph G=(N,A) and a demand or supply bi for each i∈N, such that ∑bi=0, i∈N. There are two types of costs:transportation costs cij of shipping one unit from node i to node j,and building costs dij of establishing a link(i,j) between nodes i and node j of capacity uij. We would like to build such a network in order to minimize the total building and transportation costs, so that all demand is met. Formulate the problem as an integer programming problem.
Recently Asked Questions
- How do I prove the following about convergent sequences?
- 30. The table below displays the average number of times a child was recorded as misbehaving. The two variables used to predict the number of misbehaviors was
- 12. What is a C value? What is the relationship between C value and morphological complexity? What is a C-value paradox? 13. What is the relationship between a