Bøger af Gerard Sierksma

This textbook presents a strong and clear relationship between theory and practice. It covers basic topics such as Dantzig's simplex algorithm, duality, sensitivity analysis, integer optimization models, and network models as well as more advanced topics including interior point algorithms, the branch-and-bound algorithm, cutting planes,

This textbook presents a strong and clear relationship between theory and practice. It covers basic topics such as Dantzig¿s simplex algorithm, duality, sensitivity analysis, integer optimization models, and network models as well as more advanced topics including interior point algorithms, the branch-and-bound algorithm, cutting planes, and complexity. Along with case studies, it also discusses more advanced techniques such as column generation, multiobjective optimization, and game theory. It also includes computer code in the form of models in GMPL. The book contains appendices covering mathematical proofs, linear algebra, graph theory, convexity, and a background in nonlinear optimization. All chapters contain extensive examples and exercises. .

This book aims to spark students' interest in modeling problems as networks. It contains a range of not-too-large network optimization problems that need to be analyzed and solved using the computer. All the exercises have been rigorously classroom-tested.