Welcome to the Operations Research's Home Page.
Scheduling in TV stations news and editing rooms
Scheduling and routing airplanes at airports
Finding efficient routes for snow plows; street sweepers; etc..
Course Information/Announcements, Handouts & Assignments | ||||
|
Math 3401's Syllabus Spring 2009 |
Assignment 9 is not due , BUT you must
know how to do for your final exam.
|
Project's presentations:
Wed May 6: (Fernando; David); Fri May 8: (Nathan; Olivia; Joe) |
Project's report is due by 4pm
on Fri May 1.
Handout for the
Course Project;
instructor's evaluation of course project; and
peer evaluation of Course Project;
for class on Feb 13, 2008
|
Comprehensive Final Exam on Tue May 12. It covers materials up to and including Assignment 9. |
| Assignments | ||||
Assignment 9
NOT due, but must know how to do for finals.. |
Assignment 8
due: Wed April 29, 2009. |
Assignment 7
due: Fri, April 17, 2009. |
Assignment 6
due: Mon, April 6, 2009. ( Please verify your ILP for Prob 1(a) with me before you start applying B-B) |
  |
|
Assignment 5
due: Fri, March 13, 2009 |
Assignment 4
due: Mon, March 2, 2009 |
Assignment 3
due: Fri, Feb 13, 2009 |
Assignment 2
due: Fri, Feb 6, 2009 You might find the following Grid to be helpful for Assignment 2. |
Assignment 1 due: Fri, Jan 30, 2009 |
| Handouts | ||||
Handout on
Network Simplex for solving (MCNF) for class on
April 20-28, 2009. |
  |   |   |   |
| Handout 7 for class on April 8 - 13, 2009. | Handout 6 for class on April 3 - 6, 2009. |
Handouts For class on April 3, 2009
Geometry of Cutting Plan Algorithm For: ILP - Pg 1 ; ILP - Pg 2 ; ILP - Pg 3 . Geometry of Cutting Plan Algorithm For: MILP - Pg 1 ; MILP - Pg 2 . |
Handout on the
Branch-and-Bound Algorithm for solving ILPs
for class on Mar 23-25, 2009 |
Handouts for Dual Simplex Page 1; for class on Page 2; for class on Page 3; for class on Mar 6, 2009. |
| Handout 5 for class on Mar 11, 2009. | Handout 4 for class on Feb 20-25, 2009. | Handout 1 for class on Jan 21, 2009. | Handout 2 for class on Jan 21-28, 2009. | Handout 3 for class on Jan 30, 2008. |
|   |   |   |   |   |
| Other Stuff | ||||
|
A few LP and
ILPs for the Lab
on Wed, Feb 11, 2009 |
Handout for the geometric aspects of the Simplex Method Page 1; Page 2 for class on Feb 6, 2008 |   |   |   |
A few resources on Operations Research | ||||
| GIDEN (Graphical Implementation Development Environment for Networks) (software for solving optimization problems on graphs). | GIDEN's Headquarters at Northwestern University | Linear Programming Model for the diet problem | investment portfolio using Quadratic Programming |   | Institute of Operations Research and Management Science (INFORMS) | Network Resource for Operations Research | David Pisinger's optimization codes for knapsack problems | Matroid Theory's Homepage | INFORMS' OR resources online |
| INFORMS Journals Online |   |   |   |   |
Comments on this page may be sent to pehng@morris.umn.edu
This homepage is maintained by
Peh H. Ng ,
Professor of Mathematics &
Math Discipline's Web Janitor
Mathematics Discipline
Division of Science and Mathematics
University of Minnesota - Morris
Morris, MN 56267
(320)-589-6318
email: pehng@morris.umn.edu
© 2001-2009 by Peh Ng
Last Modified Wednesday, May 06, 2009
Page URL: http://www.morris.umn.edu/~pehng/Ma3401/index.html