Abstract
This paper describes a method for determining a more profitable geographic location pattern for the warehouses that are employed by a firm in delivering known quantities of its finished product to its customers, where the number of warehouses is also permitted to vary. It is shown that this can normally be expected to be a concave minimization problem. Unfortunately, there are usually no practical computational methods for determining the values of the variables that correspond to the absolute minimum of a concave cost function. However, a local optimum can be determined by a method described in the article. The method involves a sequence of transportation computations that are shown to converge to the solution. An illustrative small scale computation is included. An appendix explains in intuitive terms the nature of the computational difficulties that arise in a concave-programming problem.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
