Syllabus/achievement requirements

The preliminary syllabus is the union of

(i) those topics that are lectured (see links to lecture notes below), and

(ii) the following from Vanderbei:

• Chapter 1-6: all
• Chapter 7: 7.1
• Chapter 11: 11.1-11.3
• Chapter 12: 12.4
• Chapter 14 (in 2.ed.: chapter 13): all sections except 14.5
• Chapter 15: 15.3 (shortest paths)
• Chapter 17: all

(Here, for instance, 11.1-11.3 means, 11.1, 11.2 and 11.3.)

We use the book

• R.Vanderbei, "Linear programming: fundations and extensions". Third Ed., Springer (2008): it may be read for free, see http://link.springer.com/book/10.1007%2F978-0-387-74388-2 . (You may use the Fourth edition, but some small differences exist).

In addition, we use lecture notes and

• the notes G.Dahl, "A mini-introduction to convexity", which may be found here www.uio.no/studier/emner/matnat/math/MAT-INF3100/v14/convmat-inf3100.pdf, and
• the notes G.Dahl, "Lagrange duality", which can be found here www.uio.no/studier/emner/matnat/math/MAT-INF3100/v14/lagrangedualitymat-inf3100.pdf