Graduate Studies and Postdoctoral Affairs (GSPA)
Needles Hall, second floor, room 2201
Subject:
Computer Science (CS)
Catalog number:
795
Unit weight:
0.50
Meet type:
LEC,TUT
Grading basis:
NUM
Cross-listing(s):
CO-602 CM-740
Requisites:
N/A
Description:
Linear optimization: Farkas' Lemma, duality, Simplex method, geometry of polyhedra. Combinatorial optimization: integrality of polyhedra, total unimodularity, flow problems, weighted bipartite matching. Continuous optimization: convex sets, Separation Theorem, convex functions, analytic characterizations of convexity, Karush-Kuhn-Tucker Theorem.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
012176