{"title":"两阶段运输问题及其两种修正","authors":"P. Stetsyuk, V. Stovba, O. Khomiak","doi":"10.17721/2706-9699.2022.1.07","DOIUrl":null,"url":null,"abstract":"In this paper, a mathematical model of an open twostage transportation problem and its two modifications are considered. The first modification takes into account the upper bounds of transitional points capacities, the second takes into account the possibility of selection of the fixed number of transitional points, which is less than their total number. For all three cases the necessary and sufficient conditions of constraints feasibility are substantiated. The results of the computational experiments using gurobi and cplex solvers are presented.","PeriodicalId":40347,"journal":{"name":"Journal of Numerical and Applied Mathematics","volume":"284 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"TWO-STAGE TRANSPORTATION PROBLEM AND ITS TWO MODIFICATIONS\",\"authors\":\"P. Stetsyuk, V. Stovba, O. Khomiak\",\"doi\":\"10.17721/2706-9699.2022.1.07\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a mathematical model of an open twostage transportation problem and its two modifications are considered. The first modification takes into account the upper bounds of transitional points capacities, the second takes into account the possibility of selection of the fixed number of transitional points, which is less than their total number. For all three cases the necessary and sufficient conditions of constraints feasibility are substantiated. The results of the computational experiments using gurobi and cplex solvers are presented.\",\"PeriodicalId\":40347,\"journal\":{\"name\":\"Journal of Numerical and Applied Mathematics\",\"volume\":\"284 1\",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Numerical and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17721/2706-9699.2022.1.07\",\"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.2022.1.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
TWO-STAGE TRANSPORTATION PROBLEM AND ITS TWO MODIFICATIONS
In this paper, a mathematical model of an open twostage transportation problem and its two modifications are considered. The first modification takes into account the upper bounds of transitional points capacities, the second takes into account the possibility of selection of the fixed number of transitional points, which is less than their total number. For all three cases the necessary and sufficient conditions of constraints feasibility are substantiated. The results of the computational experiments using gurobi and cplex solvers are presented.