LLMpediaThe first transparent, open encyclopedia generated by LLMs

András Prékopa

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: László Lovász Hop 5
Expansion Funnel Raw 81 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted81
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
András Prékopa
András Prékopa
Andras Prekopa · CC0 · source
NameAndrás Prékopa
Birth date1929-07-21
Birth placeBudapest, Hungary
Death date2016-03-22
Death placeBudapest, Hungary
NationalityHungarian
FieldsMathematics, Operations Research, Probability Theory
Alma materEötvös Loránd University
Known forStochastic Programming, Log-concavity, Prékopa's Theorem

András Prékopa

András Prékopa was a Hungarian mathematician and operations researcher noted for foundational work in stochastic programming, probability theory, and measure-theoretic inequalities. His research influenced optimization, convex analysis, and applications across logistics, economics, engineering, and statistical decision theory. Prékopa's results, including the characterization of log-concave measures and a seminal theorem bearing his name, linked classical analysis with modern computational methods.

Early life and education

Prékopa was born in Budapest and completed secondary studies in the milieu of Central European scientific traditions alongside contemporaries linked to Eötvös Loránd University, Budapest University of Technology and Economics, and research circles connected to Hungarian Academy of Sciences. He studied mathematics and probability at Eötvös Loránd University, where curricular influences included teachers and peers involved with Paul Erdős-era combinatorics, Alfréd Rényi's probability school, and interactions with scholars tied to St. Petersburg State University and Moscow State University. His formative education connected him indirectly to developments stemming from Andrey Kolmogorov, Benoit Mandelbrot, and applied strands represented by George Dantzig and Richard Bellman.

Academic career and positions

Prékopa held faculty and research positions at institutions associated with Eötvös Loránd University, the Hungarian Academy of Sciences, and international centers collaborating with Massachusetts Institute of Technology, University of California, Berkeley, and University of London research programs. He participated in conferences organized by International Federation of Operational Research Societies, Institute for Operations Research and the Management Sciences, and networks involving European Mathematical Society and Society for Industrial and Applied Mathematics. Prékopa supervised doctoral students who later joined faculties at Princeton University, Stanford University, University of Vienna, Technical University of Munich, and other universities linked to Royal Society exchanges and NATO scientific panels. His visiting appointments included seminars with groups at College de France, Universität Bonn, and the Institute of Statistical Mathematics.

Contributions to mathematics and operations research

Prékopa's research synthesized ideas from Paul Lévy's measure theory, Harold Hotelling's multivariate analysis, and developments by Louis Bachelier and Bruno de Finetti in probabilistic modeling. He formalized stochastic programming models influenced by George Dantzig's linear programming and by chance-constrained optimization frameworks connected to John von Neumann and Leonid Kantorovich. His eponymous theorem on log-concavity advanced tools used by researchers in the traditions of John Milnor, Isaac Schoenberg, and Georg Polya, and found application in portfolio optimization themes traced to Harry Markowitz and risk measures related to Artur Jensen. Prékopa established structural properties of multivariate log-concave functions that informed convex analysis traditions stemming from René Thom, Jean-Louis Lions, and Rolf Strömberg. He linked combinatorial probability methods of Paul Erdős and Alfréd Rényi with modern stochastic optimization techniques used in supply chain and telecommunication problems studied by groups at Bell Labs and IBM Research. His work influenced algorithms incorporating scenario decomposition reminiscent of methods developed at Los Alamos National Laboratory and in computational optimization at INRIA and Zuse Institute Berlin.

Awards and honors

Prékopa received national and international recognition, including distinctions from the Hungarian Academy of Sciences, prizes affiliated with János Bolyai, and honors reflecting ties to International Society on Multiple Criteria Decision Making and International Federation of Operational Research Societies. He was invited to present at major forums such as the International Congress of Mathematicians and held memberships and honorary degrees associated with institutions like University of Szeged, Corvinus University of Budapest, and European academies connected to Academia Europaea. His legacy was commemorated in special issues of journals published by IEEE, Elsevier, and Springer Nature, and through festschrifts involving contributors from Columbia University, Yale University, University of Cambridge, and University of Oxford.

Selected publications and legacy

Prékopa authored monographs and numerous articles in journals published by Springer, Elsevier, and societies such as SIAM; notable works include treatments of stochastic programming and log-concave measures that have been cited alongside classics by George Dantzig, Richard Bellman, and John von Neumann. His publications influenced subsequent research appearing in journals like Annals of Probability, Mathematics of Operations Research, Operations Research, and Journal of Applied Probability. Prékopa's students and collaborators went on to contribute at centers including Warwick University, ETH Zurich, Karlsruhe Institute of Technology, National University of Singapore, and Australian National University, extending his methods into contemporary studies in machine learning at Google Research, DeepMind, and statistical theory in groups at Harvard University and University of Chicago. His theorem remains a foundation in modern treatments involving convexity, inequalities, and stochastic systems, and his influence persists through lectures, translated texts, and continuing citations across interdisciplinary research communities tied to mathematical optimization, probability theory, and operations research.

Category:Hungarian mathematicians Category:1929 births Category:2016 deaths