Assignment:
Linear Programming/ Operation Research/ Hungarian Algorithm
Describe a procedure suitable for computer coding that will find, directly on the reduced matrix, the maximum number of independent zero cells in the reduced matrix(or equivalently, the minumum number of lines to cover all zeroes.