Abstract
We consider the problem of finding the point in the transportation polytope which is closest to the origin. Recursive formulas to solve it are provided, explaining how they arise from geometric considerations, via projections, and we derive solution algorithms with linear computational complexity in the number of variables.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.