The generalized Brouwer degree is a powerful topological tool with many applications. We will discuss the information it provides for non-convex optimization problems in finite dimensions. The talk will walk through the cases of unconstrained, equality-constrained and inequality-constrained optimization problems, and finish with a look at the degree for a bi-matrix game. A background in multi-variable calculus will be necessary and sufficient to understand this talk.