ENG M 540
Optimization Models and Algorithms

September 2009 - December 2009
Thursdays 6:00 PM to 9:00 PM

Room:
MEC 2-1


NOTE: The Exam #2 marks summary is available here, and the Project marks summary is available here. I will turn over all marked exams to the department for storage early on Friday, so if you want to look at your exam, you'll need to do so before that. Grades have been submitted and will be available on Bear Tracks in the next few days.


Instructor: John Doucette, Assistant Professor, Engineering Management

Email:

Office: 5-8F Mechanical Engineering Building (5th floor West)

Office Hours: my door is always open

Course Text (required):

Marking Scheme*:
    Assignments**: 15%
    Project: 25%
    Exam #1: 30%
    Exam #2: 30%

* Grades will roughly follow the recommended grade distribution provided by the registrar’s office.
** Assignments must be handed in during class on the due date. Complete solutions will be provided on the course web-site shortly after the due date of each assignment, and assignments will not be accepted after solutions have been posted.

Course Content:
The applications of optimization methods in solving engineering management problems. Both modeling techniques and algorithms will be covered. Specific topics include linear programming, formulation and modeling techniques, the simplex method, sensitivity analysis, duality, transportation and network problems, algorithmic and heuristic methods, integer programming, and/or non-linear programming.

Course Format:
This course will be lecture based, primarily using white-board instruction. This will be supplemented with PowerPoint slides for key illustrations, in-class discussion, and problem-solving examples. All recommended reading and other external resources will be contained in the course text-book, supplemental handouts, and on the course web-site, which I will endeavour to keep updated with relevant materials in advance.

Course Outline: available here

Note:
The University of Alberta is committed to the highest standards of academic integrity and honesty. Students are expected to be familiar with these standards regarding academic honesty and to uphold the policies of the University in this respect. Students are particularly urged to familiarize themselves with the provisions of the Code of Student Behaviour (online at www.ualberta.ca/secretariat/appeals.htm) and avoid any behaviour which could potentially result in suspicions of cheating, plagiarism, misrepresentation of facts and/or participation in an offence. Academic dishonesty is a serious offence and can result in suspension or expulsion from the University.

Policy about course outlines can be found in Section 23.4(2) of the University Calendar.


Tentative Course Schedule (subject to change):

Lecture # Date Topic Chapter
1 03 Sep 2009 Course Introduction -
    Introduction to Optimization and Modeling 1
    Resource: LPSolve -
2 10 Sep 2009 Linear Programming - Graphical 3
3 17 Sep 2009 Linear Programming - Models 3
4 24 Sep 2009 Simplex Method 4
5 01 Oct 2009 Simplex Method (cont'd) 4
6 08 Oct 2009 more on Linear Programming - Models
(In-Class Sample Problems - hand-out only)
3
- 15 Oct 2009 Exam #1 -
7 22 Oct 2009 Sensitivity Analysis 5-6
8 29 Oct 2009 Transportation Problems 7
9 05 Nov 2009 Transportation Problems (cont'd) 7
10 12 Nov 2009 Network Models 8
11 19 Nov 2009 Integer Programming 9
    catch-up, review, and project help -
- 26 Nov 2009 Project Presentations -
- 03 Dec 2009 Exam #2 -

 

Assignments:

# Problems Assigned Date Due Date Solutions
Ass't #1 Ch 3.2, prob 1, pg 63
Ch 3.2, prob 3, pg 63
Ch 3.2, prob 5, pg 63
Ch 3.3, prob 1, pg 68
Ch 3.3, prob 2, pg 68
Ch 3.3, prob 3, pg 68
Ch 3.3, prob 4, pg 68
Ch 3.3, prob 10, pg 68
10 Sept 2009 17 Sept 2009 Ass't #1 Solution
Ass't #2 Ch 3.4, prob 4, pg 71
Ch 3.5, prob 2, pg 75
Ch 3.5, prob 4, pg 75
Ch 3.8, prob 9, pg 93
Ch 3.8, prob 10, pg 93
Ch 3.9, prob 9, pg 99
Ch 3.10, prob 3, pg 104
Ch 3.12, prob 3, pg 111
17 Sept 2009 24 Sept 2009 Ass't #2 Solution
Ass't #3
OK, a shorter one this week. :-)

Ch 4.1, prob 2, pg 130
Ch 4.5, prob 2, pg 149
Ch 4.5, prob 3, pg 149
Ch 4.6, prob 1, pg 151
Ch 4.6, prob 2, pg 151
 
24 Sept 2009 01 Oct 2009 Ass't #3 Solution
Ass't #4 Ch 4.7, prob 5, pg 154
Ch 4.8, prob 5, pg 158
Ch 4.8, prob 6, pg 158
Ch 4.12, prob 1, pg 178
Ch 4.12, prob 2, pg 178
Ch 4.12, prob 3, pg 178
01 Oct 2009 08 Oct 2009 Ass't #4 Solution
Ass't #5 Ch 5.2, prob 4, pg 243
Ch 5.2, prob 5, pg 243
Ch 5, prob 5, pg 256
Ch 5, prob 6, pg 257
Ch 6.3, prob 6, pg 288
22 Oct 2009 29 Oct 2009 Ass't #5 Solution
Ass't #6 Ch 7.1, prob 2, pg 371
Ch 7.1, prob 4, pg 371
Ch 7.1, prob 11, pg 371
Ch 7.2, prob 1, pg 382
Ch 7.2, prob 4, pg 382
Ch 7, prob 3, pg 407
29 Oct 2009 05 Nov 2009 Ass't #6 Solution
Ass't #7 Ch 7.4, prob 1, pg 392
Ch 7.4, prob 2, pg 392
Ch 7.4, prob 3, pg 392
Ch 7.4, prob 4, pg 392
Ch 7.5, prob 2, pg 398
Ch 7.5, prob 8, pg 400
Ch 7.6, prob 2, pg 403
Ch 7.6, prob 3, pg 403
Ch 7.6, prob 4, pg 403
Ch 7, prob 1, pg 407
Ch 7, prob 8, pg 408

Note: It's not as long as it looks. Really. The first four problems are very quick and easy, and the three in Ch 7.6 need you to formulate the tableau only.
05 Nov 2009 12 Nov 2009 Ass't #7 Solution
Ass't #8 Ch 8.2, prob 2, pg 418
Ch 8.2, prob 8, pg 419
Ch 8.3, prob 8, pg 430
Ch 8.3, prob 9, pg 430
Ch 8.3, prob 10, pg 430
Ch 8.5, prob 3, pg 454
Ch 8.5, prob 5, pg 455
12 Nov 2009 19 Nov 2009 Ass't #8 Solution
Ass't #9 Ch 9.2, prob 2, pg 502
Ch 9.2, prob 5, pg 503
Ch 9.2, prob 10, pg 503
Ch 9.2, prob 11, pg 503
Ch 9.2, prob 12, pg 503
Ch 9.2, prob 16, pg 504
Ch 9.2, prob 22, pg 505
19 Nov 2009 26 Nov 2009 Ass't #9 Solution