Which of the following is true regarding the linear programming formulation of a transportation problem that doesn't have any unacceptable routes?
1) The constraints' left-hand-side coefficients are less than zero.
2) The number of constraints is calculated as number of origins times number of destinations.
3) The number of variables is calculated as number of origins times number of destinations.
4) The objective function value is either 0 or 1.