My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Optimization Theory and Practice
SYSM 6305
Erik Jonsson School of Engineering and Computer Science
Basics of optimization theory, numerical algorithms, and applications. The course is divided into three main parts: linear programming (simplex method, duality theory), unconstrained methods (optimality conditions, descent algorithms and convergence theorems), and constrained minimization (Lagrange multipliers, Karush-Kuhn-Tucker conditions, active set, penalty and interior point methods). Applications in engineering, operations, finance, statistics, etc. will be emphasized. Students will also use Matlab's optimization toolbox to obtain practical experience with the material. 3 credit hours.
Offering Frequency: Each year
Grades: 45
Median GPA: A
Mean GPA: 3.719
Click a checkbox to add something to compare.
Optimization Theory and Practice
SYSM 6305
Erik Jonsson School of Engineering and Computer Science
Basics of optimization theory, numerical algorithms, and applications. The course is divided into three main parts: linear programming (simplex method, duality theory), unconstrained methods (optimality conditions, descent algorithms and convergence theorems), and constrained minimization (Lagrange multipliers, Karush-Kuhn-Tucker conditions, active set, penalty and interior point methods). Applications in engineering, operations, finance, statistics, etc. will be emphasized. Students will also use Matlab's optimization toolbox to obtain practical experience with the material. 3 credit hours.
Offering Frequency: Each year
Grades: 45
Median GPA: A
Mean GPA: 3.719
Click a checkbox to add something to compare.
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
SYSM 6305 (Overall) | |||||
A | |||||
SYSM 6305 Justin Ruths | |||||
SYSM 6305 Mark Spong | |||||
A | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
SYSM 6305 (Overall) | |||||
A | |||||
SYSM 6305 Justin Ruths | |||||
SYSM 6305 Mark Spong | |||||
A | |||||