I would like to thank Professor Paul Kergin, for providing me with with a lot of his course materials from his many years of experience teaching this course in the past.
Please note that all regular office hours have ended, and these are the office hours for the final week of the semester.
Tuesday | 3-5 pm | RM. HU 1018 | Rosemonde |
---|---|---|---|
Wednesday | 12-2 pm | RM. HU 1018 | Elio |
Thursday | 1-3 pm | RM. HU 1018 | Elio |
Thursday | 3-5 pm | RM. HU 1018 | Rosemonde |
Read here for quiz 3 info Here are the solutions.
Read here for quiz 2 info Here are the solutions.
Read here for quiz 1 info. Here are the solutions.
The course outline.
The U. of T. library's copy of Kolman and Beck. Here is a copy of page 42, which is missing from the library's copy.
I have attached a short note on the terminology differences between our two textbooks. Please take a look at it here.
Our TA (Rosemonde) will have two office hrs each week. They will take place on Monday 1-2 pm Wednesday 5-6 pm in SS 2111. Please make use of them, if you can!
Apart from these problems, it is recommended that you also work on the odd-numbered problems from KB, which have answers at the back of the book.
Problems 1. Read Chapter 0 of Kohlman and Beck to review your linear algebra background. Then, solve the following questions. Problem set 1: p 21, #6b. (Additional instructions: (i). Solve for x, y, and z in terms of w. (ii). Solve for x, z, and w in terms of y.) p 21, #9a, p 28, #6c, #8b, p 42, #5d, #6b.
Problems 2. Read Section 1.1. of Kolman and Beck. Solve the following: pg. 57 #2, #4, pg. 58 #6, #8, pg. 59 #10. Put these problems in canonical form (standard "equality" form).
Problems 3. You can find the problems here.
problem set 4: p 82, #14. p 83, #16. In the preceding questions, replace instructions (b) and (c) with "draw the line z = c^T x = k, where k is the optimal value of z." p 91, #4, #8, #12. p 100, #6, #8. (NOTE: if you try doing problem #7 on page 100, you'll discover that the answer in the back of the book is wrong. The correct answer is: 7a: not a basic solution since it doesn't satisfy Ax=b. 7b: is *NOT* a basic solution because C2,C3,C5 are l-dependent*. 7c: is a basic solution with basic variables x1, x3, and x5. *BUT NOT* with x2, x3, and x5. *Also works* with x3, x4, and x5.)*Correction.Supplementary problems: 1. Prove that the set of optimal solutions of any linear programming problem is convex. 2. Prove that the set of objective values which a linear programming problem attains over its feasible region is convex. 3. Give an example of a convex set in R^2 which is not a line segment, and which has (1,0) and (0,2) as its only extreme points. 4. Find all extreme points (in R^3) of the set {(x1,x2,x3) such that x1 - x2 + x3 = -1, 3 x1 - 2 x2 + 4 x3 = 2, x1 + x2 + 3 x3 = 9, x1 >=0, x2 >= 0, x3 >= 0}.
Problems 5. You can find the problems here.
Problems 6. You can find the problems here.
Problems 7. From the KB Textbook: Section 3.1, pg 166 #2,4,6.
Solutions to problem sets: 1, 2 3 4 5
Here is a link to portal.
The Faculty of Arts and Science page on student academic integrity.