Subject:
Computational Mathematics (CM)
Catalog number:
740
Unit weight:
0.50
Meet type:
LEC
Grading basis:
NUM
Cross-listing(s):
CO-602
Requisites:
N/A
Description:
Linear Optimization: Farkas' Lemma, Duality, Simplex Method,Geometry Of Polyhedra. Combinatorial Optimization: lntegrality Of Polyheqra, 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
