
A New Algorithm for Fully Interval Integer Transportation Problem
Author(s) -
Shalini Chandran,
R Sumitha
Publication year - 2022
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2022.40470
Subject(s) - interval (graph theory) , integer (computer science) , diagonal , algorithm , mathematical optimization , process (computing) , simple (philosophy) , mathematics , integer programming , computer science , combinatorics , philosophy , geometry , epistemology , programming language , operating system
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