What people are saying - Write a review
We haven't found any reviews in the usual places.
_i=m Additional research adjacent extreme point algorithms developed approached the F.C.T. Balinski's method Charnes commodity computational results constraint matrix convex constraint set defined previously degenerate solution demand constraints developed in past efficient algorithm exact algorithm exact solution extreme point search F.C.T. models feasible solution fixed charge problem fixed charge transportation fixed charge variable Hefley and Thomas heuristic in nature i=l j=l i=m j=n included in section Kuhn and Baumol linear programming linear transportation problem lower bound minimize mixed integer Murty J45J non-basic variable number of supply objective function optimal solution origins passenger transportation planning passenger trip distribution past research point search method possible applications possible formulations reduced matrix relaxed problem Robers and Cooper route i,j S^DJ simplex method site location problems standard transportation problem starting point supply and demand supply constraints supply points total number totally unimodular University of Iowa variable costs written as follows