Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to a...Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to analyze and minimize transportation cost. This problem is well discussed in operation research for its wide application in various fields, such as scheduling, personnel assignment, product mix problems and many others, so that this problem is really not confined to transportation or distribution only. In the solution procedure of a transportation problem, finding an initial basic feasible solution is the prerequisite to obtain the optimal solution. Again, development is a continuous and endless process to find the best among the bests. The growing complexity of management calls for development of sound methods and techniques for solution of the problems. Considering these factors, this research aims to propose an algorithm “Incessant Allocation Method” to obtain an initial basic feasible solution for the transportation problems. Several numbers of numerical problems are also solved to justify the method. Obtained results show that the proposed algorithm is effective in solving transportation problems.展开更多
This paper considers a model regarding the products with finite life which allows defective items in reproduction and causes a small amount of decay. The market demand is assumed to be level dependent linear type. The...This paper considers a model regarding the products with finite life which allows defective items in reproduction and causes a small amount of decay. The market demand is assumed to be level dependent linear type. The model has also considered the constant production rate which stops after a desired level of inventories and that is the highest level of it. Due to the market demand, defective item and product’s decay, the inventory reduces to the zero level where again the production cycle starts. With a numerical search procedure</span><span style="font-size:12px;font-family:Verdana;">,</span><span style="font-size:12px;font-family:Verdana;"> the proof of the proposed model has been shown. The objective of the proposed model is to find out the total optimum inventory cost, optimum ordering cost and optimum ordering cycle.展开更多
Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution...Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.展开更多
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper present...Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.展开更多
文摘Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to analyze and minimize transportation cost. This problem is well discussed in operation research for its wide application in various fields, such as scheduling, personnel assignment, product mix problems and many others, so that this problem is really not confined to transportation or distribution only. In the solution procedure of a transportation problem, finding an initial basic feasible solution is the prerequisite to obtain the optimal solution. Again, development is a continuous and endless process to find the best among the bests. The growing complexity of management calls for development of sound methods and techniques for solution of the problems. Considering these factors, this research aims to propose an algorithm “Incessant Allocation Method” to obtain an initial basic feasible solution for the transportation problems. Several numbers of numerical problems are also solved to justify the method. Obtained results show that the proposed algorithm is effective in solving transportation problems.
文摘This paper considers a model regarding the products with finite life which allows defective items in reproduction and causes a small amount of decay. The market demand is assumed to be level dependent linear type. The model has also considered the constant production rate which stops after a desired level of inventories and that is the highest level of it. Due to the market demand, defective item and product’s decay, the inventory reduces to the zero level where again the production cycle starts. With a numerical search procedure</span><span style="font-size:12px;font-family:Verdana;">,</span><span style="font-size:12px;font-family:Verdana;"> the proof of the proposed model has been shown. The objective of the proposed model is to find out the total optimum inventory cost, optimum ordering cost and optimum ordering cycle.
文摘Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.
文摘Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.
