MULTIPLE OBJECTIVE FRACTIONAL TRANSPORTATION PROBLEM FOR BREAKABLE COMMODITY

Authors

  • Madhuri Jain Department of Mathematics and Statistics, Banasthali Vidyapith, Banasthali-304022, Rajasthan, India

Keywords:

Multiple Objective, Fractional Programming, Transportation, Lexicographic, Breakable commodity

Abstract

In the transportation business, different types of materials/items including breakable items such as units made of glass,
ceramics, plastics, mud, etc. are transported from various sources to different destinations. In this paper, a multiple
objective fractional transportation problem for breakable commodity is formulated and a multiple objective fractional dual
is developed. An algorithm is generated to determine an initial efficient basic solution by solving the related lexicographic
minimum fractional transportation problem for breakable commodity. The algorithm is supported by a real life example of
Ashi India Glass Limited, India for minimizing the multiple cost for transporting glass-wrap of flat glass.

Downloads

Download data is not yet available.

Published

2024-06-05

How to Cite

Jain, M. (2024). MULTIPLE OBJECTIVE FRACTIONAL TRANSPORTATION PROBLEM FOR BREAKABLE COMMODITY. Investigación Operacional, 42(2). Retrieved from https://revistas.uh.cu/invoperacional/article/view/9122

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.