This year's Gödel Prize - one of the most important awards in theoretical computer science - was given to two very influential papers that have long solved open questions about linear programming formulations for combinatorial optimization problems. Since these results are at the heart of the mathematics of operations research, I would like to share this success story with you. In this lecture, we will not only discuss the results and their significance, but also learn about their background story and the people involved.