History of Science and Technology Q&A for Kids and Others (March 10, 2021)
The Stephen Wolfram Podcast
00:00
The Non Linear Programming Case
Simplex algram was a way of dealing with linear inequalities. It allowed people to go much faster for even the bad cases of lina programming. Non lineoptomisation was really kind of a black box, says Bellman. In modern times, this convex optimization case has finally been solved.
Transcript
Play full episode
