uwloo

CO 452ALinear Programming

Faculty
Mathematics
Offered
Fall
Credit
0.5
Last listed
1978–79

No longer offered. It’s in Waterloo’s scanned calendars from 1976–77 to 1978–79; the 1995–96 to 2023–24 calendars are on ucalendar.

Duality theory. Degeneracy. Post-optimality analysis. Revised simplex method. Generalized upper bounding. Integer and mixed-integer programming by cutting plane methods, branch-and-bound and implicit enumeration. Prereq: C&O352a

As printed in the 1978–79 calendar, read by OCR; the scanned page is the original.

Check it elsewhere

    In the scanned calendars

    How it read in each calendar from 1976–77 to 1978–79, 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.

    1978–79 1 calendar

    Duality theory. Degeneracy. Post-optimality analysis. Revised simplex method. Generalized upper bounding. Integer and mixed-integer programming by cutting plane methods, branch-and-bound and implicit enumeration. Prereq: C&O352a

    Offered Fall · 2 class hours a week · 0.5 credit

    1976–77 to 1977–78 2 calendars

    Titled Linear and Integer Programming.

    (Theory, Applications and Related Topics) 1

    Convex sets, geometric motivation for the Simplex Aigorithm. Simplex Algorithm. Revised Simplex Algorithm. Degeneracy. Post-optimal analysis (parametric programming, sensitivity analysis, etc.). Applications, Duality Theory, Dual Simplex Algorithm. Prereq: Linear Algebra and Elementary FORTRAN or consent of instructor

    C&O 0452b WwW 2c 5

    Linear and Integer Programming

    (Theory, Applications and Related Topics) 2

    Primal Dual Algorithms. Transportation Problem. Decomposition of large systems. Formulation of integer, mixed integer, and discrete programming problems. Methods of solution (cutting plane methods, implicit enumeration, branch-and-bound, etc.). Partitioning methods. Applications, computerized methods of solution.

    C&O 0453a FS 2c 5

    Queueing Theory

    Queueing models are analyzed, including, single channel queues of infinite and finite capacity; infinite and finite customer populations. Multi-server queues in series or parallel with homogeneous and heterogeneous servers. Models incorporating customer behaviour including balking, reneging and jockeying.

    Prereq: C &0452a or 352a or consent of instructor

    Prereq: Introductory Probability

    Offered Fall · 2 class hours a week · 0.5 credit