The Noncooperative Transportation Problem (NTP) is a linear generalized Nash equlibrium problem where each player solves a classical transportation problem. We compute a set of Nash equilibria whose dimension deceeds the number of players by one. Further, we propose a subgradient method for the NTP and present an explicit formula for its subgradients. Finally, we suggest an optimization based treatment for the selection of a proper Nash equilibrium.