Abstract:  The Shortest Route Problem is a favorite topic in many Linear Programming, Applied Mathematics, and Computer Science Texts.  The problem is stated as follows:  Given a weighted, connected planar graph with n nodes, find the shortest optimal route from any one node to another node.

While this may seem like a simple task for a graph with few nodes, imagine what it would be like for a hundred or even  a thousand nodes.  We will use several computer algorithms to determine the optimal route for such large systems.  The presentation will be based on these algorithms and their connection to linear programming.