This book describes the theory and analysis of interior-point algorithms and the surge in research development over the last ten years. It derives various complexity results for linear and convex programming.