\fbox{%
  \parbox{\textwidth}{%
Find a maximum weight matching for the following weighted complete bipartite graph $G = (V, E)$.\\
Bipartition of $V,X={x_1,x_2,x_3,x_4,x_5}$ and $Y ={y_1,y_2,y_3,y_4,y_5}$\\
A edge weight function of $G$ is given as the following matrix
  \begin{equation}
      W =
      \left(
      \begin{array}{ccccc}
          8 & 1 & 4 & 3 & 2\\
          2 & 5 & 9 & 6 & 4\\
          6 & 2 & 3 & 4 & 5\\
          1 & 4 & 7 & 9 & 3\\
          5 & 0 & 8 & 1 & 2 \\
      \end{array} 
      \right)
  \end{equation} \\
where the weight of edge ${x_i,y_j}$ is the $(i,j)$-entry of $W$ for any $i,j$.
  }%
}