𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Algorithmic Principles of Mathematical Programming

✍ Scribed by Ulrich Faigle, Walter Kern, Georg Still (auth.)


Publisher
Springer Netherlands
Year
2002
Tongue
English
Leaves
342
Series
Kluwer Texts in the Mathematical Sciences 24
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.

✦ Table of Contents


Front Matter....Pages i-x
Real Vector Spaces....Pages 1-20
Linear Equations and Linear Inequalities....Pages 21-53
Polyhedra....Pages 55-70
Linear Programs and the Simplex Method....Pages 71-94
Lagrangian Duality....Pages 95-108
An Interior Point Algorithm for Linear Programs....Pages 109-121
Network Flows....Pages 123-151
Complexity....Pages 153-172
Integer Programming....Pages 173-196
Convex Sets and Convex Functions....Pages 197-240
Unconstrained Optimization....Pages 241-271
Constrained Nonlinear Optimization....Pages 273-323
Back Matter....Pages 325-339

✦ Subjects


Optimization; Mathematics of Computing; Algorithms; Discrete Mathematics in Computer Science; Theory of Computation


πŸ“œ SIMILAR VOLUMES


Basics of Programming and Algorithms, Pr
✍ Roberto Mantaci, Jean-Baptiste YunΓ¨s πŸ“‚ Library πŸ“… 2024 πŸ› BirkhΓ€user 🌐 English

<p><span>This textbook offers an introduction to topics in algorithms and programming with python. It is originally intended for mathematical students not sufficiently aware about these computer science fields seeking a deeper understanding. It addresses fundamental questions on how to analyze the p

Concurrent Programming: Algorithms, Prin
✍ Michel Raynal (auth.) πŸ“‚ Library πŸ“… 2013 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p><p>The advent of new architectures and computing platforms means that synchronization and concurrent computing are among the most important topics in computing science. Concurrent programs are made up of cooperating entities -- processors, processes, agents, peers, sensors -- and synchronization

Concurrent Programming: Algorithms, Prin
✍ Michel Raynal (auth.) πŸ“‚ Library πŸ“… 2013 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p><p>The advent of new architectures and computing platforms means that synchronization and concurrent computing are among the most important topics in computing science. Concurrent programs are made up of cooperating entities -- processors, processes, agents, peers, sensors -- and synchronization

Concurrent Programming: Algorithms, Prin
✍ Michel Raynal πŸ“‚ Library πŸ“… 2012 πŸ› Springer 🌐 English

<p>The advent of new architectures and computing platforms means that synchronization and concurrent computing are among the most important topics in computing science. Concurrent programs are made up of cooperating entities -- processors, processes, agents, peers, sensors -- and synchronization is