I described set partitioning and job scheduling problems and rambled on a bit about the ideas of integer programming and computational complexity. I said some things about my philosophy of lecturing and lecture course design. I told students about the WWW site for the course. I needed about 250 copies of the notes and had brought 260. In general, P and D do not in general have the same dimensions.
P is has n variables and D has m variables.
I gave the LP example about electricity distribution and also described the insects as optimizers problem. I mentioned that students should be able to do the first 8 questions following Lectures 1-2. I corrected the mistake at the bottom of page 7. I described a bin packing problem and mentioned the simulated annealing in terms of packing down corn-flakes in a cereal box by shaking. I said a bit about George Dantzig and his invention of the simplex algorithm in 1947.