SYEN 5342 - Linear Programming and Network Flows

Three hours lecture. Three credit hours.

This course covers salient linear optimization topics, including computational issues such as decomposition, LU factorization, and network flow. Of equal interest is the equivalence between algebraic and graph-theoretic representation of a model and its solution algorithms. The relationship between the network flow paradigm and discrete optimization is also emphasized. Last but not least are the software libraries to solve linear optimization models.

Prerequisites: SYEN 3312, or consent of instructor.