This document describes the traveling salesperson problem (TSP) and approaches to solve it, including linear programming (LP) and dynamic programming (DP). It presents two LP formulations of TSP - one using a boolean decision variable matrix and another using city ordering variables. It also provides the DP formulation, showing how to calculate the shortest path length f(i,s) from city i visiting cities in s recursively. An example TSP instance is solved using DP to find the optimal tour length of 4407 miles.