Abstract:
This thesis is intended for an audience familiar with basic linear algebra. The topic covered is the assignment problem. Chapter I is the introduction to the problem and the assumptions made. Chapter 2 discusses Kuhn's algorithm for solving the assignment problem. An example is done throughout the discussion. Chapter 3 discusses the Hungarian method for solving the assignment problem. An example follows this method. Chapter 4 discusses finding the optimal solution and Chapter 5 summarizes the two methods and gives a direction for further study.
