Approximation
| Linear Programming | |
|---|---|
 | |
| MATH340 | |
| Section: | 921 |
| Instructor: | Tali Pinksky |
| Email: | tali@math.ubc.ca |
| Office: | Math 229a |
| Office Hours: | Wed 1-2 pm or by appointment |
| Class Schedule: | Tue-Thu-Fri 2-4 pm, Wed 2-3 pm |
| Classroom: | Math Annex 1100 |
| Important Course Pages | |
| Resources | |
| Assignments | |
| Discussion | |
| Projects | |
The essence of this project is data approximation, which of course has many applications. We can mostly use chapter 14 of the book, although this can be done not just for linear functions, but for a linear combinations of different types of functions as well. Another good source is this one.
The first goal is to phrase the question and show it corresponds to a linear programming problem, and then one can either explain a specalized algorithm as in the reference above, or compute a concrete example.