HUNGARIAN ALGORITHM INVESTIGATION Name Institution Date Hungarian algorithm in the world’s strongest man event Part one The world’s strongest man refers to strong men's competition that is organized and broadcasted worldwide at the end of each December. It’s an annual event organized by IMG Media Company as well as TWI. In this sporting activity competitors’ qualifications are based on the fact that they have to place the giant load in various spots. Just like the name of the sport itself competitors participate and compete in lifting various weights in order to determine the strongest man among them. Currently Brian Shaw holds the world strongest man’s title in four consecutive events and has even gone Hollywood due to his daily stack of thick pizzas pancakes as well as 12 sourdough French toast (Seneviratne 2016). This event is currently sponsored by Commerce Casino that is based in Los Angeles California. Furthermore as compared to the Hungarian algorithm process since the athletes’ capabilities are not considered. Any form of allocation should be based on an athlete’s qualifications. In comparing the results from parts three and four it’s evident that allocation through Hungarian algorithm is more efficient. References Boria-Reverter S. (2015). Decision making in the assignment process by using the Hungarian algorithm with OWA operators. Technological and Economic Development of Economy 21(5) 684-704. Gavrilov G. P. & Sapozhenko A. A. (2013). Problems and exercises in discrete mathematics (Vol. 14). Springer Science & Business Media. Salhi S. & Quayson E. (2016). Proposed Heuristic Method for Solving Assignment Problems. American Journal of Operations Research 6(06) 436. Seneviratne S. (2016). Watts the amount Eddie Hall could save on his electricity bill?. Journal of Interdisciplinary Science Topics Volume 5 5 57. Yin J. & Dong T. (2017). Querying similar process models based on the Hungarian algorithm. IEEE Transactions on Services Computing 10(1) 121-135. [...]
All of the instructions are uploaded in the picture below. The calculation part are pretty much done and is also uploaded below. I also uploaded a copy of my previous math investigation to give a comparison. It's max 12 pages of work but i have already done 4 of it, so i am thinking of about total of 9 to 12 pages of work.