Course Description:

We will attempt to cover as many of the following topics as possible.
Introduction to linear programming, problem formulation, geometric solutions, a brief review of linear algebra, convex sets and convex functions, polyhedral sets, extreme points, the simplex method, feasible and basic feasible solutions, optimality and boundedness, the two phase method, artificial variables, the big-M method, degeneracy and cycling, the revised simplex method, bounded variables, duality, primal-dual relationship, the dual simplex method, sensitivity and parametric analysis, complexity of the simplex algorithm and polynomial algorithms, basic definitions and terminology from graph theory, the maximal flow problem, combinatorial applications, the shortest path problem, minimal cost network flows, the transportation and assignment problems.

The concepts developed in this course will help the students to create mathematical models for the solution of problems which can be analyzed by the methods of linear programming and network flows.

There will be a mid-term, a final examination, and several homework assignments.  All the assignments will be discussed in class.  The grading will be relative or “on the curve”, i.e., the performance of a student relative to the class will be important.

The material upto and including the topic “simplex method” will be covered before the mid-term.  The final examination will be based on the entire course material, however greater emphasis will be laid on the material covered after the mid-term.  (The calendar of events will be included at the beginning of the relevant semester.)

Text- Linear programming and network flows, M.S. Bazaraa, J.J. Jarvis and H.D. Sherali, John Wiley, second edition, 1990.  A calculator will be helpful.

Any students with disabilities, or other special needs, who need special accommodations in this course are invited to share these concerns or requests with the instructor as soon as possible.

All work in this course must be completed in a manner consistent with NDSU University Senate Policy, Section 335: Code of Academic Responsibility and Conduct (http://www.ndsu.nodak.edu/policy/335.htm).