Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
