Recommended exercises in SF1811/31/41 Optimization, 2012.

The exercises in the exercise booklet are mostly a collection of final exam questions. Most of them have quite complete solutions.

Linear optimization

Simplex method
 1.2 (a) and (b),
 1.4 (a),
 1.5 (a) and (b),
 1.6 (a),
 1.14,
 1.15,
 7.1 (a) and (b).

Formulation problems
 1.1,
 1.3,
 1.9,
 1.4 (a),

Duality
 1.2 (c) and (d),
 1.4 (4),
 1.5 (c),
 1.6 (b),

Network problems
 2.1,
 2.2,
 2.5,
 2.9,

Quadratic Programming problems
 5.2,
 5.9,
 5.10,
 5.4,

Convexity
 3.1,
 3.4,
 3.6,
 3.9,

Linear Algebra
The linear algebra part of the course was added recently, so there are no examples in the exercise book on this part. Look also at
 exercise 3a on the exam 2008-03-11
 exercise 4 on the exam 2008-05-30
 exercise 2 b-d on the exam 2009-08-25
 exercise 1b on the exam 2011-03-19
 exercise 2a on the exam 2011-06-08

If you know swedish, you may consider the following questions from exams in SF1861
  Exercise 1b in tentamen 2010-08-25
  Exercise 1b in tentamen 2010-05-27
  Exercise 3a in tentamen 2009-05-19
  Exercise 1b in tentamen 2008-08-26


Lagrange relaxation and duality
 4.1,
 4.2,
 4.3,
 4.7,
 4.10,

Nonlinear programming
 6.1,
 6.2,
 6.3,
  6.5, 6.7, 6.11 and 7.5 deal with quadratic programs with quadratic constraints. They can be solved using a specialized method that was part of the course previously, but now we can only look at these problems from a more general nonlinear programming view.
 6.6,
 6.8,
 7.1-3,