In this paper, the following two problems are considered:Problem I. Given S ∈ Rn×p, X, B ∈ Rn×m, find A ∈ SRs,n such that AX = B, where SRs,n = {A ∈ Rn×n|xT(A - AT) = 0, for all x ∈ R(S)}.Problem Ⅱ. Given A* ∈ Rn×n, find A ∈ SE such that ‖A^-A*‖ = minA∈sE‖A-A*‖,where SE is the solution set of Problem Ⅰ.The necessary and sufficient conditions for the solvability of and the general form of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.