Abstract
In this paper, we deal with a numerical comparison between two exact simplicial methods for solving a capacitated four-index transportation problem. The first method was developed by R. Zitouni and A. Keraghel for solving this problem [Resolution of a capacitated transportation problem with four subscripts, Kybernetes, Emerald journals, 32, 9/10: 1450-1463 (2003)]. The second approach is the well-known simplex method.
 We show across some obtained numerical results that the first algorithm competes well with the simplex method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 Numerical Analysis and Approximation Theory
Paper Title
Journal
Date
