The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a new question has emerged: how the maximum edge count is affected by forbidding some subgraphs occurring in these extremal graphs? In [3], the problem is solved in triangle-free graphs for $d \geq m$, and for $d < m$ with either $Z(d) \leq m < 2d$ or $d \leq 6$, where $Z(d)$ is approximately $5d/4$. The authors derived structural properties of triangle-free extremal graphs, which allows us to focus on constructing small extremal components to form an extremal graph. Based on these findings, in this paper, we develop an integer programming formulation for constructing extremal graphs. Since our formulation is highly symmetric, we use our own implementation of Orbital Branching to reduce symmetry. We also implement our integer programming formulation so that the feasible region is restricted iteratively. Using a combination of the two approaches, we expand the solution into $d \leq 10$ instead of $d \leq 6$ for $m > d$. Our results endorse the formula for the number of edges in all extremal triangle-free graphs conjectured in [3].