Master Assignment Problem Algorithm

Description

The basic tools of Operations Research (OR). OR is a bunch of mathematical tools to solve business-related problems. (For other tools like Linear Programming, Critical Path Method, Sequencing Problem, Game theory, Transportation Problem, see other courses by the instructor)

The manual method to solve (AP) will be discussed and demonstrated with several examples

These problems are typically to maximize or minimize the value of a certain parameter given a situation that the resources and their uses are matched one-on-one basis in case of an Assignment Problem.

The manual method also known as Hungarian Assignment Problem is demonstrated manually by solving problems that could be upto 6x6 size.

The Hungarian Assignment Problem is a very simple but effective algorithm in solving a 'resources to use' type of problem, such as assigning workers to jobs, or salesmen to different territories, or assigning rooms to managers or assigning incoming flight route to outgoing flight route etc. The key  in solving a problem is drawing the minimum number of vertical or horizontal lines through Hungarian Matrix, which will cancel out all zeros. To achieve this, a very simple procedure is enumerated in the course, with enough practice so that the student can do it on her own.

What You Will Learn!

• Students will learn to solve problems needing application of the Hungarian Assignment Problem
• They will learn to solve maximisation problems and minimisation problems using the algorithm
• They will be able to solve unbalanced problems also
• Thwy will be able to apply the algorithm to several situations which need the assignment problem technique

Who Should Attend!

• Anyone who wants to learn about Assignment Problem Algorithm.
• Scholars and academicians looking to learn more about Assignment Problem
• Anyone doing Engineering, with Operations Research as one of the subjects
• MBA and BMS Scholars with Operations Research as subject

TAKE THIS COURSE