Mathematical Programming The State of the Art

Bonn 1982

A. Bachem, M. Grötschel, B. Korte (Herausgeber)

Buch | Softcover

VIII, 658 Seiten

2011 | 1. Softcover reprint of the original 1st ed. 1983
Springer Berlin (Verlag)
978-3-642-68876-8 (ISBN)

Artikel merken

In the late forties, Mathematical Programming became a scientific discipline in its own right. Since then it has experienced a tremendous growth. Beginning with economic and military applications, it is now among the most important fields of applied mathematics with extensive use in engineering, natural sciences, economics, and biological sciences. The lively activity in this area is demonstrated by the fact that as early as 1949 the first "Symposium on Mathe matical Programming" took place in Chicago. Since then mathematical programmers from all over the world have gath ered at the intfrnational symposia of the Mathematical Programming Society roughly every three years to present their recent research, to exchange ideas with their colleagues and to learn about the latest developments in their own and related fields. In 1982, the XI. International Symposium on Mathematical Programming was held at the University of Bonn, W. Germany, from August 23 to 27. It was organized by the Institut fUr Okonometrie und Operations Re search of the University of Bonn in collaboration with the Sonderforschungs bereich 21 of the Deutsche Forschungsgemeinschaft. This volume constitutes part of the outgrowth of this symposium and docu ments its scientific activities. Part I of the book contains information about the symposium, welcoming addresses, lists of committees and sponsors and a brief review about the Ful kerson Prize and the Dantzig Prize which were awarded during the opening ceremony.

I. About the XIth International Symposium on Mathematical Programming.- Program and Organizing Committee.- Welcoming Addresses.- List of Sponsors.- The Fulkerson Prize and the Dantzig Prize 1982.- II. Mathematical Programming: The State of the Art - Bonn 1982.- Predictor-Corrector and Simplicial Methods for Approximating Fixed Points and Zero Points of Nonlinear Mappings.- Polyhedral Theory and Commutative Algebra.- Reminiscences About the Origins of Linear Programming.- Penalty Functions.- Applications of the FKG Inequality and its Relatives.- Semi-Infinite Programming and Applications.- Applications of Matroid Theory.- Recent Results in the Theory of Machine Scheduling.- Submodular Functions and Convexity.- Recent developments in Algorithms and Software for Trust Region Methods.- Variable Metric Methods for Constrained Optimization.- Polyhedral Combinatorics.- Generalized Equations.- Generalized Subgradients in Mathematical Programming.- Nondegeneracy Problems in Cooperative Game Theory.- Conic Methods for Unconstrained Minimization and Tensor Methods for Nonlinear Equations.- Min-Max Results in Combinatorial Optimization.- Generalized Gradient Methods of Non-Differentiable Optimization Employing Space Dilatation Operations.- The Problem of the Average Speed of the Simplex Method.- Solution of Large Linear Systems of Equations by Conjugate Gradient Type Methods.- Stochastic Programming: Solution Techniques and Approximation Schemes.- III. Scientific Program.- IV. List of Authors.

Erscheint lt. Verlag	7.12.2011
Zusatzinfo	VIII, 658 p.
Verlagsort	Berlin
Sprache	englisch
Maße	170 x 244 mm
Gewicht	1139 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Graphentheorie
Schlagworte	ART • combinatorics • Information • Optimierung • Optimization • programming
ISBN-10	3-642-68876-4 / 3642688764
ISBN-13	978-3-642-68876-8 / 9783642688768
Zustand	Neuware