Assignment Problems: Introduction, Assumptions and Variations/Assignment Problems - Part 1

Operations Research-
Assignment Problems/Models (Part-1)

In this part, students will learn about the fundamentals of assignment problems, definition and various assumptions in assignment problems. Different types of variations in assignment problems such as maximization case, restriction on assignments and balanced/unbalanced assignment problems has been explained in details for better understanding of topic.

In part 2, students will learn about finding optimal solution to assignment problem by Hungarian Method or Reduced Matrix Method. Detailed step-by-step methodology of finding optimal solution to assignment problem has been discussed in detail.

In part 3, one assignment problem has been taken and optimal solution to that assignment problem has been found by Hungarian Method. Students will learn the detailed step-by-step procedure of finding the optimal solution to problem by Hungarian Method.

In part 4, one balanced assignment problem has been taken and optimal solution to that assignment problem has been found by Hungarian Method. Students will learn the detailed step-by-step procedure of finding the optimal solution to problem by Hungarian Method.

In part 5, one unbalanced assignment problem has been taken and optimal solution to that assignment problem has been found by Hungarian Method. Students will learn the detailed step-by-step procedure of finding the optimal solution to problem by Hungarian Method.

In part 6, maximization cases in assignment problem has been taken in which the objective function is to maximize the profit. Converting maximization problem into minimization has been discussed and optimal solution to that assignment problem has been found by Hungarian Method. Students will learn the detailed step-by-step procedure of finding the optimal solution to problem by Hungarian Method.

In part 7, maximization cases in assignment problem has been taken in which the objective function is to maximize the profit. Optimal solution to that assignment problem has been found by Hungarian Method. Students will learn the detailed step-by-step procedure of finding the optimal solution to problem by Hungarian Method.

In part 8, variation in assignment problem has been discussed i.e. restrictions on assignments. Sometimes restrictions are given in problem e.g. some tasks cannot be assigned to workers due to cost, technical or any other constraint. Finding optimal solution when restrictions are given has been discussed in detail with the help of such type of assignment problem.

In part 9, variation in unbalanced assignment problem has been discussed i.e. restrictions on assignments. Sometimes restrictions are given in problem e.g. some tasks cannot be assigned to workers due to cost, technical or any other constraint. Optimal solution has been found by Hungarian Method.

In part 10, travelling salesman problems has been discussed. Students will understand the concept of travelling salesman problems in assignment problems. Finding shortest path which reduces cost, time, distance etc. taking care of certain conditions has been explained. Methodology of finding shortest path in travelling salesman problems has been discussed.

In part 11, travelling salesman problem has been taken into consideration and step-by-step procedure of finding shortest path/route has been explained in detail.

In part 12, travelling salesman problem has been taken into consideration and step-by-step procedure of finding shortest path/route has been explained in detail taking care of conditions in these types of problems while finding shortest path/route.

Prof. (Dr.) A.K. Gupta
Simplifying Mathematics
“Learning Accessible to all..”

[FiilixAcademy]

Thanks you sir. This solves my problems.👍

[malikasaini]

Thanks alot sir🥰, it's very helpful for me, means alot ✨🥰.