TY - JOUR
T1 - A KKM approach for inverse capacitated transportation problem in neutrosophic environment
AU - Khalifa, Hamiden Abd El Wahed
AU - Kumar, Pavan
AU - Mirjalili, Seyedali
N1 - Funding Information:
The authors would like to thank the Editor-in-Chief and anonymous referees for their suggestions and helpful comments that have led to an improvement both in the quality and clarity of the paper.
Publisher Copyright:
© 2021, Indian Academy of Sciences.
PY - 2021/9
Y1 - 2021/9
N2 - Inverse optimization is one of the interesting areas in both fundamental and applied research. This paper introduces a new approach, named as Khalifa, Kumar, and Mirjalili (KKM) approach, for solving the inverse capacitated transportation problem (ICTP) in a neutrosophic environment. The problem is considered with unit transportation cost associated with the single-valued trapezoidal neutrosophic numbers. Using the proposed KKM approach, the objective of the research work is to make the transportation cost as low as possible, which can lead to an optimal feasible solution. Based on the score function, the neutrosophic problem is first converted into an equivalent deterministic problem and then into a linear programming (LP) problem. Afterwards, by applying the dual and optimality conditions the inverse problem is obtained. In the end, an illustrative example is given to support the proposed approach and to gain more insights.
AB - Inverse optimization is one of the interesting areas in both fundamental and applied research. This paper introduces a new approach, named as Khalifa, Kumar, and Mirjalili (KKM) approach, for solving the inverse capacitated transportation problem (ICTP) in a neutrosophic environment. The problem is considered with unit transportation cost associated with the single-valued trapezoidal neutrosophic numbers. Using the proposed KKM approach, the objective of the research work is to make the transportation cost as low as possible, which can lead to an optimal feasible solution. Based on the score function, the neutrosophic problem is first converted into an equivalent deterministic problem and then into a linear programming (LP) problem. Afterwards, by applying the dual and optimality conditions the inverse problem is obtained. In the end, an illustrative example is given to support the proposed approach and to gain more insights.
KW - Algorithm
KW - capacitated transportation problem
KW - complementary slackness
KW - Inverse programming
KW - optimal solution
KW - Optimization
KW - single-valued
KW - trapezoidal neutrosophic number
KW - two phase method
UR - http://www.scopus.com/inward/record.url?scp=85112429744&partnerID=8YFLogxK
U2 - 10.1007/s12046-021-01682-5
DO - 10.1007/s12046-021-01682-5
M3 - Article
AN - SCOPUS:85112429744
SN - 0256-2499
VL - 46
JO - Sadhana - Academy Proceedings in Engineering Sciences
JF - Sadhana - Academy Proceedings in Engineering Sciences
IS - 3
M1 - 166
ER -