Subject: Mathematics
Credit units: 3
Offered: Either Term 1 or Term 2
Weekly hours: 3 Lecture hours and 1 Practicum/Lab hours
College: Arts and Science
Department: Mathematics and Statistics

This course introduces the fundamentals of mathematical optimization methods, centering around linear programming. Topics include formulating real-life problems (such as production planning, inventory, shortest path and assignment problems) as linear programs, the simplex algorithm, geometry of feasible regions and optimal solutions, duality theory and complementary slackness conditions. Tools relating linear and integer programs such as Gomory cuts and branch-and-bound methods, as well as applications in game theory, will also be discussed.

Prerequisite(s): MATH 163.3; and MATH 164.3 or MATH 266.3.

For full details about upcoming courses, refer to the class search tool or, if you are a current student, the registration channel in PAWS.

• Class search
• Registration channel

The syllabus is a public document that provides detail about a class, such as the schedule of activities, learning outcomes, and weighting of assignments and examinations.

Once an instructor has made their syllabus publicly available on USask’s Learning Management System, it will appear below. Please note that the examples provided below do not represent a complete set of current or previous syllabus material. Rather, they are presented solely for the purpose of indicating what may be required for a given class. Unless otherwise specifically stated on the content, the copyright for all materials in each course belongs to the instructor whose name is associated with that course. The syllabus is the intellectual property of instructors or the university.

For more information, visit the Academic Courses Policy , the Syllabus page for instructors , or for students your Academic Advising office.

• Bookstore Textbook Search
• Library Reserves Search
• USask Tutoring Network