MATH 452Linear Programming (Theory, Applications, and Related Topics)
- 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.
Preliminaries, convex sets, convex functions, geometric motivation for the Simplex Algorithm. Simplex Algorithm. Revised Simplex Algorithm. Degeneracy. Duality Theory. Transportation Problem, Shortest Path Problem. Primal Dual Algorithms. Maximum flow problems, Max-flow Min-Cut Theorem, Ford- Fulkerson Labelling Algorithm. Assignment Problems. Transshipment Problem. Capacitated Transportation Problem. Bounded Variables. Dual Simplex Algorithm. Post-optimal analysis (parametric programming, sensitivity analysis, etc.). Discrete Linear Programming. Branch and Bound Algorithms. * The Travelling Salesman Problem. Integer Programming. Comments: Throughout this course an attempt will be made to indicate the various areas in which the techniques mentioned above may be applied. These areas include: inventory control, production scheduling, optimal product mix problems, blending problems, game theory, economic input-output models, project scheduling (Critical Path, Decision C.P.M., etc.), bottleneck problems, cost-benefit analysis, cutting stock problem, etc. Students will be required to use the computer to solve “semi-practical” problems, and some knowledge of computer programming is a definite asset. 2 hours lectures, one year Prerequisites: M229 (or equivalent). Students will be required to use the computer on occasion and M132 (or its equivalent) would be a definite asset
As printed in the 1972–73 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.
1972–73 to 1974–75 2 calendars
Preliminaries, convex sets, convex functions, geometric motivation for the Simplex Algorithm. Simplex Algorithm. Revised Simplex Algorithm. Degeneracy. Duality Theory. Transportation Problem, Shortest Path Problem. Primal Dual Algorithms. Maximum flow problems, Max-flow Min-Cut Theorem, Ford- Fulkerson Labelling Algorithm. Assignment Problems. Transshipment Problem. Capacitated Transportation Problem. Bounded Variables. Dual Simplex Algorithm. Post-optimal analysis (parametric programming, sensitivity analysis, etc.). Discrete Linear Programming. Branch and Bound Algorithms.
* The Travelling Salesman Problem. Integer Programming.
Comments: Throughout this course an attempt will be made to indicate the various areas in which the techniques mentioned above may be applied. These areas include: inventory control, production scheduling, optimal product mix problems, blending problems, game theory, economic input-output models, project scheduling (Critical Path, Decision C.P.M., etc.), bottleneck problems, cost-benefit analysis, cutting stock problem, etc. Students will be required to use the computer to solve “semi-practical” problems, and some knowledge of computer programming is a definite asset. 2 hours lectures, one year Prerequisites: M229 (or equivalent). Students will be required to use the computer on occasion and M132 (or its equivalent) would be a definite asset
Not in the 1971–72 calendar.
1968–69 to 1970–71 3 calendars
Titled Linear Programming.
Mathematical foundations. Simplex method and revised simplex method, Duality. Computational methods. Assignment and transportation problems. Integer Programming. Applications to game theory, industrial problems and economic theory. 2 hours lectures.