A New Technique to Solve the Maximization of the Transportation Problems (original) (raw)

One of the most important linear programming applications in operations research (OR) is the transportation problems (TP) formulation and solution as a linear programming problem (LPP) which is related to daily activities in our real life and mainly deals with logistics. The objective of this work is to introduce a new technique for solving (TP) that has an objective function of the type of maximization. This new technique was obtained by adding an important step to the method for finding the initial solution (IS) for the (TP) that has an objective function of the type of miniaturization that was proposed previously by Hussein, H. A. et al. This proposed new technique solves both of balanced and unbalanced (TP), it includes easy solution steps in terms of understanding and application, as well as achieving the results of the optimal or near the optimal solution (OS), thus saving a lot of time and effort when using it to solve these problems. By comparing the new technique with the three classical methods, NorthWest corner method (NWCM), least cost method (LCM), and Vogel's Approximation Method (VAM), the (IS) obtained by the new technique is better than the three methods in general. Furthermore the new technique is characterized by the ease, simplicity and speed of implementation the steps compared with the other three methods.

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact