Trilekha › CMA Final › P16 › 8 Assignment › 8.0

8.0 Assignment

104 lectures (104 with exact minutes) · 8 past exam questions · about 4.5 marks per exam · tier A for Dec 2026

Assignment applies Linear Programming to allocate resources to activities on a one-to-one basis, minimizing cost or time using the Hungarian Method developed by Harold Kuhn. It details LP mathematical formulations, row and column operations for matrix reduction, line-covering optimality tests, and matrix improvements. The material walks through special cases: maximization problems using relative loss matrices, unbalanced problems introducing dummy rows or columns, prohibited assignments marked with high values M, alternative optimum solutions, Travelling Salesman Problems, and Generalized Assignment Problems.

Other topics in 8 Assignment