Abstract
Abstract: In this paper, we propose an optimal diagonal algorithm under a generalized interval arithmetic for solving the problem of complete interval integer transport without converting the crisp equivalent problem .The proposed algorithm is simple to implement and it offers a numerical illustration to demonstrate the efficacy of the proposed process. Keywords: Transportation problem, Mathematical formulation using interval integer transportation problem, Numerical, Examples
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have