This course exposes students to the theory and techniques of deterministic mathematical programming. Linear programming and its extensions, integer programming and network flows are the main areas of focus.The purpose is to provide a strong theoretical basis required for creating mathematical models of real world problems of interest and also developing effective methodologies for their solution and implementation. To this end, the course also reviews computational complexity issues and discusses techniques for building efficient computational methods in combinatorial optimization along with associated theory such as duality, relaxation, decomposition and column generation.