Abstract
An iterative decomposition method based on the sequential solution of two-dimensional problems subject to constraints from different groups is successfully applied to the case of integer transportation problems with convex objective functions and ascribed suppliers and consumers is proposed. Through the introduction of new variables, it has been possible to extend the constructions of the algorithm in which the central point is the solution of optimization problems with two constraints. A detailed analysis of these problems is presented in the present paper.
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 callMore From: Journal of Computer and Systems Sciences International
Disclaimer: 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.
