DIVIDE ROW MINIMA AND SUBTRACT COLUMN MINIMA TECHNIQUE FOR SOLVING ASSIGNMENT PROBLEMS.
- Department of Mathematics, Comilla University-3506, Bangladesh.
37 Downloads
212 Views
Abstract
Assignment problems deal with the question how to assign n objects to m other objects in an injective fashion in the best possible way. An assignment problem is completely specified by its two components the assignments, which represent the underlying combinatorial structure, and the objective function to be optimized, which models \\\"the best possible way\\\". The assignment problem refers to another special class of linear programming problem where the objective is to assign a number of resources to an equal number of activities on a one to one basis so as to minimize total costs of performing the tasks at hand or maximize total profit of allocation. In this paper we introduce a new technique to solve assignment problems namely, Divide Row Minima and Subtract Column Minima .For the validity and comparison study we consider an example and solved by using our technique and the existing Hungarian (HA) and matrix ones assignment method(MOA) and compare optimum result shown graphically.
Keywords
Article Analytics
References
- King, K. N., Java Programming from the Beginning, W.W. Norton & Co., New York, 2000.
- Kuhn, H. W. ?The Hungarian method for the assignment problem?, Naval Research LogisticsQuarterly2, 83-97.
- Dantzig, B.G., ?Application of the simplex method to a transportation problem?, in Koopmans, T.C. (ed.), Activity Analysis and Production and Allocation, Willey, N.Y., 1951, 359-373.
- Dantzig, B.G., Linear Programming and Extensions, Princeton University Press, Princeton.
- F Votaw ,1952,A.Orden ,The personal assignment problem ,Symposium on Linear Inequalities and Programming, SCOOP 10 US Air Force ,pp.155-163.
- S. Bazarra, John J. Jarvis, Hanif D. Sherali, Linear programming and network flows, (2005). B. s. Goel, S. K. Mittal, Operations Research, Fifth Ed., (1982) 2405-2416.
- Hamdy A. Taha, Operations Research, an introduction, 8th Ed. (2007). H. J. Zimmermann, Fuzzy set theory and its Applications, third Ed., kluwer Academic, Boston, 1996.
- Anshuman Sahu, Rudrajit Tapador, Solving the assignment problem using genetic algorithm and simulated annealing, IJAM, (2007).
- Singh S.(2011) International Journal of Operation Research and International System,3(3),87-89.
- Hung, M.S., and Rom, W.D., ?Solving the assignment problem by relaxation?, Operations Research, 28 (1980) 969-982.
- Akgul, M., ?A genuinely polynomial primal simplex algorithm for the assignment problem?, Working Paper IEOR 87-07, Bilikent University, Ankara, Turkey, 1987. Balinski, M.L., and Gomory, R.E., ?A primal method for the assignment and transportation problems?, Management Sciences, 10 (1964) 578-598.
- Barr, R.S., Glover, F., and Klingman, D., ?The alternating basis algorithm for assignment problems?, Mathematical Programming, 13 (1977) 1-13.
- Bertsekas, D., ?A new algorithm for the assignment problem?, Mathematical Programming, 21 (1981) 152-171.
- Shweta sing and all. ?A Comparative Analysis of Assignment Problem?,IOSR Journal of Engineering(IOSREN),ISSN:2250-3021 Volume 2,Issue 8(August 2012),PP 01-15
- Hadi Basirzadeh, ?One Assignment Method for Solving Assignment Problems?,Applied Mathematical Science,Vol.6,2012 no.47,2345-2355.
How to Cite This Article
Mohammad Anwar Hossen and Afsana Akther. (2017); DIVIDE ROW MINIMA AND SUBTRACT COLUMN MINIMA TECHNIQUE FOR SOLVING ASSIGNMENT PROBLEMS., Int. J. of Adv. Res., 5 (12), 1323-1329, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/6089
Corresponding Author
This work is licensed under a Creative Commons Attribution 4.0 International License.





