A note on the lattice structure for matching markets via linear programming

Given two stable matchings in a many-to-one matching market with \begin{document}$ q $\end{document} -responsive preferences, by manipulating the objective function of the linear program that characterizes the stable matching set, we compute the least upper bound and greatest lower bound between them.