A generalization of iteration-free search vectors of ABS methods

Recently, we introduced iteration-free search vectors of the ABS methods and showed how they can be used to compute the search directions of primal--dual interior point methods, when the coefficient matrix of the constraints of the linear programming problem is square. Here, we generalize those results for the general case when, the coefficient matrix is non-square.