Syllabus/achievement requirements
The syllabus is the union of
(i) those topics that are lectured (see lecture notes)
(ii) The lecture notes of G. Dahl, including "A mini-introduction to convexity"
(iii) the following from Vanderbei's book (see below):
- Chapter 1-6: all.
- Chapter 7: 7.1.
- Chapter 11: 11.1-11.3.
- Chapter 12: 12.4.
- Chapter 14: all sections except 14.5.
- Chapter 15: 15.1-15.3.
- Chapter 17: all.
(Here, for instance, 11.1-11.3 means, 11.1, 11.2 and 11.3.)
We use the following edition of Vanderbei's book:
- R. Vanderbei, "Linear Programming: Foundations and Extensions". Fourth Edition, Springer (2014). It may be downloaded for free, see More