This book offers a comprehensive treatment of the exercises and case studies as well as summaries of the chapters of the book Linear Optimization and Extensions by Manfred Padberg. It covers the areas of linear programming and the optimisation of linear functions over polyhedra infinite dimensional Euclidean vector spaces.
The main topics treated in the book are: Simplex algorithms and their derivatives including the duality theory of linear programming; Polyhedral theory, pointwise and linear descriptions of polyhedra, double description algorithms, Gaussian elimination with and without division, the complexity of simplex steps; Projective algorithms, the geometry of projective algorithms, Newtonian barrier methods; Ellipsoids algorithms in perfect and infinite precision arithmetic, the equivalence of linear optimisation and polyhedral separation; The foundations of mixed-integer programming and combinatorial optimisation.