Jun 26, 2024  
2007-2008 Graduate Catalog 
    
2007-2008 Graduate Catalog [NOTE!!!! THIS IS AN ARCHIVED CATALOG. FOR THE CURRENT CATALOG, GO TO CATALOG.NIU.EDU]

ISYE 571 - Linear Programming and Network Flows


Formulation and solution techniques for linear programming and network flow problems. Simplex method, theory, and computation. Duality theory, sensitivity analysis. Maximum flow minimum cut theorem. Shortest routes, minimum cost flows.

Prerequisites & Notes
PRQ: ISYE 370 or consent of department.

Credits: 3