MATH 352(a) Fundamentals of ; Optimization
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1973–74 to 1974–75 (before that, 1968–69 to 1971–72 used the number for Mathematical Operations Research and Mathematical Operations Research (A) Fundamentals(b) Network Programming); the 1995–96 to 2023–24 calendars are on ucalendar.
Introductory study of optimization techniques common to a wide variety of operations research and engineering problems, and of fundamental. theoretical interest. Linear programming, simplex method, duality; integer and non-linear programming; convexity; branch and bound, network programming, optimal paths and trees, transportation problems, flows, PERT, replacement policies, knapsack problems. Recommended for students desiring mathematical background for operations research, industrial engineering, computer science and for those wishing to pursue advanced courses in mathematical programming and combinatorics. 2 hours lectures, one term. Prerequisites: Completion of M229, 237, 239 or consent of instructor.
As printed in the 1973–74 to 1974–75 calendars, read by OCR; the scanned page is the original.
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1968–69 to 1974–75, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1973–74 to 1974–75 2 calendars
Introductory study of optimization techniques common to a wide variety of operations research and engineering problems, and of fundamental. theoretical interest. Linear programming, simplex method, duality; integer and non-linear programming; convexity; branch and bound, network programming, optimal paths and trees, transportation problems, flows, PERT, replacement policies, knapsack problems. Recommended for students desiring mathematical background for operations research, industrial engineering, computer science and for those wishing to pursue advanced courses in mathematical programming and combinatorics. 2 hours lectures, one term. Prerequisites: Completion of M229, 237, 239 or consent of instructor.
Not in the 1972–73 calendar.
1971–72 1 calendar
Another title: Mathematical Operations Research (A) Fundamentals(b) Network Programming, probably a different course under the same number (or a misread scan).
Classical optimization; linear programming; dynamic programming; probability models, reliability optimization. 2 hours lectures.
Network and matrix methods for special linear problems. 2 hours lectures.
1968–69 to 1970–71 3 calendars
Another title: Mathematical Operations Research, probably a different course under the same number (or a misread scan).
Review of mathematical techniques frequently used in Operations Research; including difference-differential equations, Lagrange Multipliers, generating functions, quadratic forms, minimax algorithms in directed graphs. Introduction to Linear programming, Dynamic programming, transport network theory. Applications to production planning, inventory problems, growth and survival models, scheduling problems, replacement policies and reliability optimization of complex systems. 2 hours lectures.