|Title:||Linear Programming, Matrix Games, and Linear Approximation|
|Seminar:||Algebra and Number Theory Seminar|
|Speaker:||Leonid Vaserstein, Penn State|
|Linear Programming is about optimization of linear functions subject to linear
constraints; Matrix Games is about 2-player 0-sum games; Linear Approximation is about approximate solutions for system of linear equations (precise definitions will be given, so talk will be accessible to undergraduate students).
Several connections between these 3 big (in comparison with algebra and number
theory) areas of applied mathematics (and some other areas, e.g., statistics) are known.
We will show that these 3 areas are equivalent (at least, from the computational point of view).|