True or False

A shortest-route problem can be treated as a network flow problem with unit flow. In representing a network optimization problem as a linear program, there will be as many variables as the number of arcs in the network. In the representation of a network optimization problem as a linear program, each node will correspond to a linear programming constraint. A linear programming constraint corresponding to node in a network is simply a balance equation that requires the inflow to egual the outflow of that node