Algorithmic Principles of Mathematical Programming

Ulrich Faigle, Walter Kern, Georg Still

Research output: Book/ReportBookAcademic

Abstract

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.
Original languageEnglish
Place of PublicationDordrecht, The Netherlands
PublisherKluwer Academic Publishers
Number of pages337
ISBN (Print)1-4020-0852-X
DOIs
Publication statusPublished - 2002

Publication series

NameTexts in the Mathematical Sciences
PublisherKluwer
Volume24
ISSN (Print)0927-4529

Fingerprint

Mathematical Programming
Efficient Algorithms
Numerical Linear Algebra
Algorithmic Complexity
Complexity Theory
Discrete Optimization
Nonlinear Optimization
Linear programming
Calculus
Optimization Problem

Keywords

  • METIS-208582

Cite this

Faigle, U., Kern, W., & Still, G. (2002). Algorithmic Principles of Mathematical Programming. (Texts in the Mathematical Sciences; Vol. 24). Dordrecht, The Netherlands: Kluwer Academic Publishers. https://doi.org/10.1007/978-94-015-9896-5
Faigle, Ulrich ; Kern, Walter ; Still, Georg. / Algorithmic Principles of Mathematical Programming. Dordrecht, The Netherlands : Kluwer Academic Publishers, 2002. 337 p. (Texts in the Mathematical Sciences).
@book{511c77b539b74fb683eee765881a74ef,
title = "Algorithmic Principles of Mathematical Programming",
abstract = "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 = "METIS-208582",
author = "Ulrich Faigle and Walter Kern and Georg Still",
year = "2002",
doi = "10.1007/978-94-015-9896-5",
language = "English",
isbn = "1-4020-0852-X",
series = "Texts in the Mathematical Sciences",
publisher = "Kluwer Academic Publishers",
address = "Netherlands",

}

Faigle, U, Kern, W & Still, G 2002, Algorithmic Principles of Mathematical Programming. Texts in the Mathematical Sciences, vol. 24, Kluwer Academic Publishers, Dordrecht, The Netherlands. https://doi.org/10.1007/978-94-015-9896-5

Algorithmic Principles of Mathematical Programming. / Faigle, Ulrich; Kern, Walter ; Still, Georg.

Dordrecht, The Netherlands : Kluwer Academic Publishers, 2002. 337 p. (Texts in the Mathematical Sciences; Vol. 24).

Research output: Book/ReportBookAcademic

TY - BOOK

T1 - Algorithmic Principles of Mathematical Programming

AU - Faigle, Ulrich

AU - Kern, Walter

AU - Still, Georg

PY - 2002

Y1 - 2002

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

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

KW - METIS-208582

U2 - 10.1007/978-94-015-9896-5

DO - 10.1007/978-94-015-9896-5

M3 - Book

SN - 1-4020-0852-X

T3 - Texts in the Mathematical Sciences

BT - Algorithmic Principles of Mathematical Programming

PB - Kluwer Academic Publishers

CY - Dordrecht, The Netherlands

ER -

Faigle U, Kern W, Still G. Algorithmic Principles of Mathematical Programming. Dordrecht, The Netherlands: Kluwer Academic Publishers, 2002. 337 p. (Texts in the Mathematical Sciences). https://doi.org/10.1007/978-94-015-9896-5