MATH 455AMathematical Programming — A
- Faculty
- Mathematics
- Last listed
- 1975–76
No longer offered. It’s in Waterloo’s scanned calendars from 1975–76 to 1975–76 (before that, 1972–73 used the number for Nonlinear Programming55b Dynamic Programming and Quadratic Programming); the 1995–96 to 2023–24 calendars are on ucalendar.
Dynamic Programming; deterministic decision pro- cess problems, monotonic path problems, equipment replacement, resource allocation, reduction of dimen- sion by use of Lagrange multipliers, shortest path problems, cargo loading problem, the travelling sales- man problem; introduction to optimal control. Convex functions; first and second order character- ization of convex functions. 2 hours lectures, one term Course Descriptions Mathematics
As printed in the 1975–76 calendar, read by OCR; the scanned page is the original.
Requirements, as last listed
Prerequisite: M352a or consent of the instructor
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1972–73 to 1975–76, 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.
1975–76 1 calendar
Dynamic Programming; deterministic decision pro-
cess problems, monotonic path problems, equipment
replacement, resource allocation, reduction of dimen-
sion by use of Lagrange multipliers, shortest path
problems, cargo loading problem, the travelling sales-
man problem; introduction to optimal control. Convex functions; first and second order character-
ization of convex functions.
2 hours lectures, one term
Course Descriptions Mathematics
Prerequisite: M352a or consent of the instructor
Not in the 1973–74 to 1974–75 calendars.
1972–73 1 calendar
Another title: Nonlinear Programming55b Dynamic Programming and Quadratic Programming, probably a different course under the same number (or a misread scan).
Nonlinear programming convex sets and convex functions; convergence conditions and convergence rates for some unconstrained optimization methods; introduction to Kuhn-Tucker theory and duality theory for nonlinear programmes; economic interpretation of dual variables. 2 hours lectures, one term. Prerequisites: Math 352a.
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. Prerequisites: Math 455a.