We consider here the problem of finding a non-negative solution to a set of linear equations which minimizes a bottleneck type objective. Two algorithms are described for the general problem and a single algorithm for the bottleneck transportation problem.