There are many real-world situations that can be mathematically modeled to find an optimal solution. Whether it be in managing resources, maximizing profits, or minimizing travel distances, we have all, in many unique ways, used the process of optimization. With this vast importance, it seems rather obvious that effort should be made to create the most efficient and strong approaches to these decision problems. Boolean satisfiability (SAT) is the most basic language of computation and logic and can be used in unique ways to potentially address optimization problems. The aim of the research is to uncover a specific instance in which the solution to an optimization problem can be better addressed through satisfiability.