Consider the directed network below. The first number along each edge is the capacity of that edge, the second number the cost of assigning one unit of flow through that edge. A total flow of 10 should be sent from S to T through the network. This should be done in such a way that the edge capacities are not exceeded, and that the total cost is as low as possible. o this exercise: S 7,3 6,4 A 75,2 B 5,3 8,3 16,2 black or blue on white copy paper. click on 'Continue', and add a second photo in the next step if needed. 8,4 6,5 T Formulate a complete LP that can be used to solve this problem. Do not solve the LP. Note: The LP should be formulated in such a way that a similar LP can be used to solve the minimum cost flow for any other network.

Consider the directed network below. The first number along each edge is the capacity of that edge, the second number the cost of assigning one unit of flow through that edge. A total flow of 10 should be sent from S to T through the network. This should be done in such a way that the edge capacities are not exceeded, and that the total cost is as low as possible. Formulate a complete LP that can be used to solve this problem. Do not solve the LP. Note: The LP should be formulated in such a way that a similar LP can be used to solve the minimum cost flow for any other network. this exercise: black or blue on white copy paper. click on 'Continue', and add a second photo in the next step if needed