Top Tweets for #linearprogramming

One morning in 1939, a young doctoral student named George Bernard Dantzig hurried into his statistics class at the University of California, Berkeley—late. The blackboard was already packed with equations. Professor Jerzy Neyman, one of the leading statisticians of the time, was about to erase it. “Just a moment,” Dantzig asked, quickly copying everything down. Among the notes were two problems, which he assumed were ordinary homework assignments. At home, Dantzig noticed something strange. These problems were far harder than usual. Still, he worked on them relentlessly and eventually found solutions—so late, in fact, that he handed them in with an apology. Neyman barely looked up. “Just leave them on my desk,” he said, pointing to a chaotic pile of papers. Weeks passed. Then, one Sunday morning, there was a knock at Dantzig’s door. It was Professor Neyman—excited, holding a stack of typed pages. “Read this immediately,” Neyman said. “I’m submitting it for publication today.” Dantzig was stunned. His “homework” had become a research paper. What he had copied from the blackboard were not assignments at all, but two famous statistical conjectures that had resisted proof for years. Unaware of their reputation, Dantzig had simply treated them as difficult exercises—and solved them. That same student would later become the father of linear programming, inventing the simplex algorithm, a cornerstone of modern optimization and operations research. Sometimes, the biggest breakthroughs happen when you don’t know something is supposed to be impossible.