| Manfred Wilhelm Padberg | |
| Birth Date: | 10 October 1941 |
| Birth Place: | Bottrop, Germany |
| Workplaces: | New York University |
| Alma Mater: | Carnegie Mellon University |
| Thesis Title: | Essays in Integer Programming |
| Thesis1 Title: | and |
| Thesis2 Title: | )--> |
| Thesis1 Url: | and |
| Thesis2 Url: | )--> |
| Thesis Year: | 1971 |
| Thesis1 Year: | and |
| Thesis2 Year: | )--> |
| Doctoral Advisor: | Egon Balas |
| Doctoral Advisors: | )--> |
| Awards: | John von Neumann Theory Prize |
| Spouses: | )--> |
| Partners: | )--> |
Manfred Wilhelm Padberg (October 10, 1941 in Bottrop, Germany[1] –May 12, 2014) was a German mathematician who worked with linear and combinatorial optimization. He and Ellis L. Johnson won the John von Neumann Theory Prize in 2000.
Padberg grew up in Zagreb, Croatia, and Westphalia. From 1961 he studied mathematics at the University of Münster, where he graduated in 1967. In 1967, he was a research assistant at the University of Mannheim. Starting in September 1968, he studied at Carnegie Mellon University, where he obtained a master's degree and his Ph.D. (1971) in Industrial Administration. His advisor was Egon Balas and his dissertation was titled Essays in Integer Programming.
Afterwards he worked from 1971 to 1974 at the Berlin Science Center. From 1974, he was Associate Professor and, from 1978, Professor of Operations Research at New York University. He became a professor emeritus in 2002. He moved to Paris in 2002.
He, Martin Shubik, Ellis L. Johnson, and Harlan Crowder won the Frederick W. Lanchester Prize in 1983. He was elected to the 2002 class of Fellows of the Institute for Operations Research and the Management Sciences.
He died in 2014 from cancer.[2]