Abstract
The Transportation problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. Although it can be solving as a linear programming problem. Linear programming makes use of the simplex method, an algorithm invented to solve a linear program by progressing from one extreme point of the feasible polyhedron to an adjacent one. The algorithm contains tactics like pricing and pivoting. For a transportation problem, a simplified version of the regular simplex method can be used, known as the transportation simplex method. In this paper will discuss the functionality of both of these algorithms, and compared their optimized values with non-linear method called the Lagrange Multiplier Method. Lagrange Multiplier is an algorithm that uses different mechanisms to choose the best optimal solutions. This method based on transforming the linear structure transportation problem into the nonlinear structure and solved it directly, by the techniques. The objective of the study was to find out how these algorithms behave in terms of accuracy and speed when a large-scale problem is being solved.
Highlights
The Transportation problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints
Weighted edge(s) The objective of a Transportation Problem is to determine the Number of units to be transported from source ( i ) to destination ( j ) so that the total transportation cost is minimum (Phillips et al.,1976 ; Gupta & Hira, 2002)
One way to solve Transportation Problems is through a method called Linear Programming
Summary
The Transportation problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. It can be solving as a linear programming problem. Lagrange Multiplier is an algorithm that uses different mechanisms to choose the best optimal solutions This method based on transforming the linear structure transportation problem into the nonlinear structure and solved it directly, by the techniques. This problem is simple and can be solved without much effort. The section will briefly discuss how this can be done
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.