Department of Mathematics, School of Advanced Sciences, VIT University, Vellore-14, Tamilnadu, India
*Corresponding Author E-mail: pandian61@rediffmail.com
Online published on 2 March, 2017.
In this paper, a unit shipping cost problem for a transportation problem with mixed constraints is constructed in which the unit shipping cost of the problem is minimized. Then, a new method namely, less-more method is proposed for solving the unit shipping cost problem for the transportation problem with mixed constraints. The optimal solution of the unit shipping cost problem provides a shipping plan for the transportation problem with mixed constraints such that its unit shipping cost is fewer and the number of transporting items is more than or equal to its optimal solution. Numerical examples in Pharmaceutical Logistics are presented to illustrate the solution procedure of the less-more method.
Transportation problem, Mixed constraints, Unit shipping cost problem, Optimal solution, Lessmore method
