Volume : VI, Issue : IV, April - 2017
OPTIMIZATION OF STOCHASTIC BICRITERIA TIME MINIMIZATION TRANSPORTATION PROBLEM
K. B. Devaki, Dr. S. Kumaraghuru
Abstract :
This paper provides a solution procedure to Bi–level Stochastic Transportation Problem (BSTP) under exponential distributed random variables. In this model, we suppose that the superior and the Assistant operate two separate groups of plants is a reputed distribution ship from the executive, who moves first, determines products shipped to customers and then, the assistant decides his own quantities rationally. Here both the superior’s and the assistant’s objective is to minimize the sum of the corresponding total transportation costs and the total expected shortage cost. Our proposed approach transformed into a single level non–linear programming by using its Karush – Kuhn – Tucker conditions. At the end a relevant numerical example is presented to illustrate the model.
Keywords :
Stochastic Programming Bi–level Programming Stochastic Transportation Problem Exponential Distributed Demand
Article:
Download PDF
DOI : 10.36106/ijsr
Cite This Article:
K.B.DEVAKI, Dr. S.KUMARAGHURU, OPTIMIZATION OF STOCHASTIC BICRITERIA TIME MINIMIZATION TRANSPORTATION PROBLEM, INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH : VOLUME-6 | ISSUE-4 | APRIL‾2017
Number of Downloads : 402
References :
K.B.DEVAKI, Dr. S.KUMARAGHURU, OPTIMIZATION OF STOCHASTIC BICRITERIA TIME MINIMIZATION TRANSPORTATION PROBLEM, INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH : VOLUME-6 | ISSUE-4 | APRIL‾2017
Our Other Journals...
-
Indian Journal of
Applied Research Visit Website -
PARIPEX Indian Journal
of Research Visit Website -
Global Journal for
Research Analysis Visit Website
/images/ijar-text.png)
MENU
MENU