{"title":"网络流分析作为供应链管理优化的一种方法","authors":"D. I. Symonov","doi":"10.17721/2706-9699.2023.1.01","DOIUrl":null,"url":null,"abstract":"The paper considers several methods of analyzing opportunities for optimizing supply chains. An iterative method of finding the optimal structure is proposed, considering the power of the supply chain links and the capacity of the paths between them. The theorem on the value of the maximum flow in the combined path is proved. A numerical simulation of the operation of the proposed algorithm for finding directions for the optimization of the network structure was performed.","PeriodicalId":40347,"journal":{"name":"Journal of Numerical and Applied Mathematics","volume":"14 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"NETWORK FLOW ANALYSIS AS A METHOD OF SUPPLY CHAIN MANAGEMENT OPTIMIZATION\",\"authors\":\"D. I. Symonov\",\"doi\":\"10.17721/2706-9699.2023.1.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper considers several methods of analyzing opportunities for optimizing supply chains. An iterative method of finding the optimal structure is proposed, considering the power of the supply chain links and the capacity of the paths between them. The theorem on the value of the maximum flow in the combined path is proved. A numerical simulation of the operation of the proposed algorithm for finding directions for the optimization of the network structure was performed.\",\"PeriodicalId\":40347,\"journal\":{\"name\":\"Journal of Numerical and Applied Mathematics\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Numerical and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17721/2706-9699.2023.1.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Numerical and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17721/2706-9699.2023.1.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
NETWORK FLOW ANALYSIS AS A METHOD OF SUPPLY CHAIN MANAGEMENT OPTIMIZATION
The paper considers several methods of analyzing opportunities for optimizing supply chains. An iterative method of finding the optimal structure is proposed, considering the power of the supply chain links and the capacity of the paths between them. The theorem on the value of the maximum flow in the combined path is proved. A numerical simulation of the operation of the proposed algorithm for finding directions for the optimization of the network structure was performed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
