Abstract: The completion problems for any nonnegative partial matrices of any order to be inverse M matrices are discussed.A graph theoretic completion result,as well as a determinant maximizing completion that is characterized by having a zero entry in the inverse in every position in which the partial matrix has an unspecified entry,is given for the inverse M matrix problem.The algorithm which can be used effectively to get the determinant maximizing completion is also presented.