Abstract
Building on the analysis of simple problems with three source zones, a general but approximate method for solving the transportation problem of linear programming is proposed. The method uses successive adjustments to the row dual variables, and rapidly reduces the number of columns which need to be considered. It offers promising computational capabilities for problems where the ratio of the number of columns to the number of rows is very large.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
