MATH 455(a) Mathematical Programming — A
- Faculty
- Mathematics
- Last listed
- 1974–75
No longer offered. It’s in Waterloo’s scanned calendars from 1968–69 to 1974–75; the 1995–96 to 2023–24 calendars are on ucalendar.
Dynamic Programming; deterministic decision process problems, monotonic path problems, equipment replacement, resource allocation, reduction of dimension by use of Lagrange multipliers, shortest path problems, cargo loading problem, the travelling salesman problem; introduction to optimal control. Convex functions; first and second order characterization of convex functions. 2 hours lectures, one term Prerequisites: M352 or consent of instructor
As printed in the 1974–75 calendar, 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.
1974–75 1 calendar
Dynamic Programming; deterministic decision process problems, monotonic path problems, equipment replacement, resource allocation, reduction of dimension by use of Lagrange multipliers, shortest path problems, cargo loading problem, the travelling salesman problem; introduction to optimal control. Convex functions; first and second order characterization of convex functions. 2 hours lectures, one term Prerequisites: M352 or consent of instructor
1973–74 1 calendar
Another title: (b) Dynamic Programming and Quadratic Programming, probably a different course under the same number (or a misread scan).
Quadratic Programming: Lemke’s complementary pivot scheme to solve a quadratic programme. : Dynamic Programming: deterministic decision process problems; monotomic path problems; equipment replacement; resource allocation; reduction of dimension by use of Lagrange multipliers; shortest path problems; the travelling salesman problem; introduction to optimal control theory. 2 hours lectures, one term. Prerequisite: M 455 (a)
Not in the 1972–73 calendar.
1968–69 to 1971–72 4 calendars
An introduction to the methods and applications of integer programming, non-linear programming and dynamic programming. 2 hours lectures.