uwloo

CO 355Mathematical Optimization

Faculty
Mathematics
Offered
Fall
Credit
0.5
Last listed
1994–95

No longer offered. It’s in Waterloo’s scanned calendars from 1993–94 to 1994–95; the 1995–96 to 2023–24 calendars are on ucalendar.

Linear optimization: feasibility theorems, duality, the simplex algorithm. Discrete optimization: integer linear programming, cutting planes, network flows. Continuous optimization: local and global optima, feasible directions, convexity, necessary optimality conditions. C&O 355 may be substituted for C&O 350 in any degree program, or for prerequisite purposes.

As printed in the 1993–94 to 1994–95 calendars, read by OCR; the scanned page is the original. Later calendars (1995–96 on) aren’t on uwloo.

Requirements, as last listed

Prereq: MATH 235, 237

Antireq: C&O 350, ACTSC 335

In today’s calendar

Check it elsewhere

In the scanned calendars

How it read in each calendar from 1993–94 to 1994–95, 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.

1993–94 to 1994–95 2 calendars

Linear optimization: feasibility theorems, duality, the simplex algorithm. Discrete optimization: integer linear programming, cutting planes, network flows. Continuous optimization: local and global optima, feasible directions, convexity, necessary optimality conditions.

C&O 355 may be substituted for C&O 350 in any degree program, or for prerequisite purposes.

Prereq: MATH 235, 237

Antireq: C&O 350, ACTSC 335

Offered Fall · 3 class hours a week · 0.5 credit