{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:22:29Z","timestamp":1648844549728},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p> In this paper, we discuss paradox in a linear Transportation Problem. Thereby, we establish a sufficient condition for the existence of paradox in a linear transportation problem. Next we find out all the Paradoxical pairs as well as paradoxical range of flow. We also illustrate a numerical example in support of the theory. <\/jats:p>","DOI":"10.1142\/s1793830912500498","type":"journal-article","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T21:24:37Z","timestamp":1351545877000},"page":"1250049","source":"Crossref","is-referenced-by-count":0,"title":["THE ALGORITHM OF FINDING ALL PARADOXICAL PAIRS IN A LINEAR TRANSPORTATION PROBLEM"],"prefix":"10.1142","volume":"04","author":[{"given":"MANJUSRI","family":"BASU","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani-741235, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DEBIPRASAD","family":"ACHARYA","sequence":"additional","affiliation":[{"name":"Department of Mathematics, N.V.College, Nabadwip, Nadia, W.B., India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ATANU","family":"DAS","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kalyani, Kalyani-741235, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(97)00070-4"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1973.10"},{"key":"rf3","volume-title":"An Introduction to Linear Programming","author":"Charnes A.","year":"1953"},{"key":"rf4","first-page":"11","volume":"13","author":"Charnes A.","year":"1971","journal-title":"Cachiers du Centre dEtudes de Recherche Operationelle"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1080\/02331939308843896"},{"key":"rf7","volume-title":"Linear Programming","author":"Hadley G.","year":"1987"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1941201224"},{"key":"rf9","first-page":"167","volume":"26","author":"Joshi V. D.","year":"2010","journal-title":"Mathematika"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1974.78"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.1.91"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800180206"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:14:19Z","timestamp":1565111659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,1,4]]},"published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1142\/S1793830912500498"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500498","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}