Algorithmic Principles of Mathematical Programming

Algorithmic Principles of Mathematical Programming by Ulrich Faigle, W. Kern, G. Still.

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Faigle, Ulrich (Author), Kern, W. (Author), Still, G. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Dordrecht : Springer Netherlands : Imprint: Springer, 2002.
Edition:1st ed. 2002.
Series:Texts in the Mathematical Sciences, 24
Springer eBook Collection.
Subjects:
Mathematical optimization.
Computer science—Mathematics.
Algorithms.
Computers.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 1. Real Vector Spaces
  • 2. Linear Equations and Linear Inequalities
  • 3. Polyhedra
  • 4. Linear Programs and the Simplex Method
  • 5. Lagrangian Duality
  • 6. An Interior Point Algorithm for Linear Programs
  • 7. Network Flows
  • 8. Complexity
  • 9. Integer Programming
  • 10. Convex Sets and Convex Functions
  • 11. Unconstrained Optimization
  • 12. Constrained Nonlinear Optimization
  • List of frequently used Symbols.

Similar Items