Main results of the paper are as follows:

(1) For any finite metric space $M$ the Lipschitz-free space on $M$ contains a large well-complemented subspace that is close to $\ell _{1}^{n}$.

(2) Lipschitz-free spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to $\ell _{1}^{n}$ of the corresponding dimensions. These classes contain well-known families of diamond graphs and Laakso graphs.

Interesting features of our approach are: (a) We consider averages over groups of cycle-preserving bijections of edge sets of graphs that are not necessarily graph automorphisms. (b) In the case of such recursive families of graphs as Laakso graphs, we use the well-known approach of Grünbaum (1960) and Rudin (1962) for estimating projection constants in the case where invariant projections are not unique.

Optimal sizes, number, and locations of Tennessee livestock auction markets were identified as those which minimize the combined costs of assembling and marketing livestock for the state using a separable programming model. The model includes transportation costs, economies of size in market operation, a proxy for reductions in buyers' operating costs attributable to increasing market volumes, and livestock production density, both in and around the state. The model is sufficiently comprehensive and descriptive to be of practical use by policy makers who influence industry change. Results indicate that a reduction in market numbers would lower combined costs.