Due to the complexity of arranging logistic chains for long distances taking into account a large number of variables, it is necessary to apply methods for optimizing such processes. One of the solutions can be the formalization of such task in the form of a linear programming problem, for solving which a simplex method can be used. On the example of X5 group, the critical task of optimizing logistic supplies for chain stores for long distances is completed in this work as the linear programming problem with the help of MS EXCEL.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.