Advertisement

Algorithmic Principles of Mathematical Programming

  • Ulrich Faigle
  • Walter Kern
  • Georg Still

Part of the Kluwer Texts in the Mathematical Sciences book series (TMS, volume 24)

Table of contents

  1. Front Matter
    Pages i-x
  2. Ulrich Faigle, Walter Kern, Georg Still
    Pages 1-20
  3. Ulrich Faigle, Walter Kern, Georg Still
    Pages 21-53
  4. Ulrich Faigle, Walter Kern, Georg Still
    Pages 55-70
  5. Ulrich Faigle, Walter Kern, Georg Still
    Pages 71-94
  6. Ulrich Faigle, Walter Kern, Georg Still
    Pages 95-108
  7. Ulrich Faigle, Walter Kern, Georg Still
    Pages 109-121
  8. Ulrich Faigle, Walter Kern, Georg Still
    Pages 123-151
  9. Ulrich Faigle, Walter Kern, Georg Still
    Pages 153-172
  10. Ulrich Faigle, Walter Kern, Georg Still
    Pages 173-196
  11. Ulrich Faigle, Walter Kern, Georg Still
    Pages 197-240
  12. Ulrich Faigle, Walter Kern, Georg Still
    Pages 241-271
  13. Ulrich Faigle, Walter Kern, Georg Still
    Pages 273-323
  14. Back Matter
    Pages 325-339

About this book

Introduction

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.

Keywords

Mathematica algorithms calculus complexity complexity theory computer computer science linear algebra linear optimization network nonlinear optimization optimization programming

Authors and affiliations

  • Ulrich Faigle
    • 1
  • Walter Kern
    • 2
  • Georg Still
    • 2
  1. 1.University of CologneCologneGermany
  2. 2.University of TwenteEnschedeThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-015-9896-5
  • Copyright Information Springer Science+Business Media B.V. 2002
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-90-481-6117-1
  • Online ISBN 978-94-015-9896-5
  • Series Print ISSN 0927-4529
  • Buy this book on publisher's site
Industry Sectors
Pharma
Materials & Steel
Finance, Business & Banking
Aerospace
Oil, Gas & Geosciences
Engineering