CORRECTED QUESTION ON OPERATIONS RESEARCH

OPERATIONS RESEARCH For the dynamic network in the figure below assuming that cet most one unit of a flow can enter any arc of Ce during any time period, What is the marimum amount that can be sent from node a at time t-o so as to reach node d by time t=5? All flux values must be non- negative. There is no limit on storage, that is on the amount that can be held over at a node from one time period to the next. (After solving the problem in terms of the "Space-timerepresentation of the network, translate the solution back to a "schedule" for how the flow is to be organized in terms of the original network.) lao 0,4 tos 1 bo 6,2 be b 14 - 52 o del d OPERATIONS RESEARCH For the dynamic network in the figure below assuming that cet most one unit of a flow can enter any arc of Ce during any time period, What is the marimum amount that can be sent from node a at time t-o so as to reach node d by time t=5? All flux values must be non- negative. There is no limit on storage, that is on the amount that can be held over at a node from one time period to the next. (After solving the problem in terms of the "Space-timerepresentation of the network, translate the solution back to a "schedule" for how the flow is to be organized in terms of the original network.) lao 0,4 tos 1 bo 6,2 be b 14 - 52 o del d