| |
Mar 05, 2026
|
|
|
|
|
MATH 4310 - Mathematical Programming II (3) Credit Hours
Goal programming, network models, integer programing, dynamic programming, Karmarkar’s method, complexity and convergence analysis of optimization algorithms.Prerequisites: MATH 2030 or MATH 3000 , and MATH 3310 with a minimum grades of C or department head approval.
Add to Portfolio (opens a new window)
|
|