Abstract
A mathematical model of a two-stage transportation problem with two-sided constraints on consumer demands and upper bounds on the bandwidths of intermediate points is considered. The necessary and sufficient conditions of consistency of the linear constraints system of the corresponding linear programming problem are substantiated. Two mathematical models of a two-stage transportation problem are presented, to which the initial model can be reduced. The results of computational experiments on applying the problem described to the optimal set partitioning problem using the CPLEX solver from the NEOS server are presented. Keywords: two-stage transportation problem, linear programming problem, constraint system compatibility, optimal set partitioning, CPLEX, NEOS.ming problem, constraint system compatibility, optimal set partitioning, CPLEX, NEOS.
Published Version
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 call