| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA481 | OPTIMIZATION II | 2027 | 1 | Mathematical Sciences | 3.0 (BS=0.0, ET=0.0, MA=3.0) | ||||
| SCOPE | |||||||||
| This course builds on the foundations of Optimization I and explores advanced topics in optimization and decision-making. Students study extensions of advanced linear and integer programming, large-scale and decomposition methods, and modern algorithmic approaches. The course may include topics such as optimization under uncertainty, stochastic programming, dynamic programming, and sequential decision problems. Applications to real-world systems and the use of advanced optimization software are emphasized throughout. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| Several special problems. | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA371 | 2003 | 1 | 1 | Y | |
| AYT | #SECT/SIZE | CPBLTY | ENRLD | WAIT | SEATS | CLOSED | DETAILS | ||
| 2027 - 2 | 2 | 18 | 36 | 33 | 0 | 3 | N | Hours | |
| 2027 - 8 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2027 - 9 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2028 - 2 | 2 | 18 | 36 | 3 | 0 | 33 | N | Hours | |
| 2028 - 8 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2028 - 9 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2029 - 2 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2029 - 8 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2029 - 9 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA481 | LINEAR OPTIMIZATION | 2020 | 1 | Mathematical Sciences | 3.0 (BS=0.0, ET=0.0, MA=3.0) | ||||
| SCOPE | |||||||||
| This course emphasizes the applications of optimal solutions to linear algebraic systems using the simplex method of linear programming. This includes an in-depth development of the simplex method, the theory of duality, an analysis of the dual problem, convex hull concepts, integer programming, sensitivity analysis and the revised simplex procedure. Additional computational techniques that are applicable to specific mathematical models such as the transportation problem, assignment problem and network problems are also studied. Problems illustrating applications are emphasized throughout the course. Use of existing computer software to solve problems is also emphasized. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| Several special problems. | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA371 | 2003 | 1 | 1 | Y | |
| AYT | #SECT/SIZE | CPBLTY | ENRLD | WAIT | SEATS | CLOSED | DETAILS | ||
| 2026 - 2 | 2 | 18 | 36 | 33 | 0 | 3 | N | Hours | |
| 2026 - 9 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA481 | LINEAR OPTIMIZATION | 2014 | 2 | Mathematical Sciences | 3.0 (BS=0.0, ET=1.0, MA=2.0) | ||||
| SCOPE | |||||||||
| This course emphasizes the applications of optimal solutions to linear algebraic systems using the simplex method of linear programming. This includes an in-depth development of the simplex method, the theory of duality, an analysis of the dual problem, convex hull concepts, integer programming, sensitivity analysis and the revised simplex procedure. Additional computational techniques that are applicable to specific mathematical models such as the transportation problem, assignment problem and network problems are also studied. Problems illustrating applications are emphasized throughout the course. Use of existing computer software to solve problems is also emphasized. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| Several special problems. | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA371 | 2003 | 1 | 1 | Y | |
| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA481 | LINEAR OPTIMIZATION | 2003 | 2 | Mathematical Sciences | 3.0 (BS=0.0, ET=3.0, MA=0.0) | ||||
| SCOPE | |||||||||
| This course emphasizes the applications of optimal solutions to linear algebraic systems using the simplex method of linear programming. This includes an in-depth development of the simplex method, the theory of duality, an analysis of the dual problem, convex hull concepts, integer programming, sensitivity analysis and the revised simplex procedure. Additional computational techniques that are applicable to specific mathematical models such as the transportation problem, assignment problem and network problems are also studied. Problems illustrating applications are emphasized throughout the course. Use of existing computer software to solve problems is also emphasized. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| Several special problems. | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA371 | 2003 | 1 | 1 | Y | |
| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA481 | MATHEMATICAL PROGRAMMING | 1975 | 1 | Mathematical Sciences | 3.0 (BS=0.0, ET=3.0, MA=0.0) | ||||
| SCOPE | |||||||||
| This course emphasizes the applications of optimal solutions to linear algebraic systems using the simplex method of linear programming. This includes an in-depth development of the simplex method, the theory of duality, an analysis of the dual problem, convex hull concepts, integer programming, sensitivity analysis and the revised simplex procedure. Additional computational techniques that are applicable to specific mathematical models such as the transportation problem, assignment problem and network problems are also studied. Problems illustrating applications are emphasized throughout the course. Use of existing computer software to solve problems is also emphasized. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| Two special problems. | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA371 | 1980 | 1 | 1 | Y | |