The partial orthogonalization process and its application to the optimal assignment problem (Q2706804)

Using a partial orthogonalization process it is proved that the vector \([1/n,1/n, \dots, 1/n]\) is a feasible normal solution of the well known assignment problem: find \(\min CX\) under the constraints \(AX=1\), \(X\geq 0\), where \((2n,n^2)\) matrix \(A\) has corresponding structure with \(0,1\) elements. An explicit form of the simplex table for this solution is derived which can be used as an initial table for subsequent iterations.NEWLINENEWLINENEWLINEUnfortunately, the paper under review contains errors, namely in somewhat confusing notation.