Не ви допада? Няма проблеми! При нас имате възможност за връщане в рамките на 30 дни
Няма да сбъркате с подаръчен ваучер. Получателят може да избере нещо от нашия асортимент с подаръчен ваучер.
30 дни за връщане на стоката
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 optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces. Here are the main topics treated in the book: 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 in finite precision arithmetic, the equivalence of linear optimization and polyhedral separation. The foundations of mixes-integer programming and combinatorial optimization.