In a maximal flow problem, the

number of arcs exiting a node is equal to the number of constraints.

number of arcs entering a node is equal to the number of arcs exiting the node.

objective is to determine the maximum amount of flow that can enter and exit a network system in a given period of time.

flow out of a node is less than the flow into the node.