Course Search | Main

MA481 COURSE DETAILS


4 Version(s) of this Course

MA481 (Version: 2020 1) COURSE DETAILS


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.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
Several special problems.

MA481 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA371 2003 1 1 Y

MA481 (Version 2020-1) COURSE OFFERINGS


AYT #SECT/SIZE CPBLTY ENRLD WAIT SEATS CLOSED DETAILS
2025 - 2 1 18 18 7 0 11 N Hours
2025 - 8 1 18 18 0 0 18 N Hours
2025 - 9 1 18 18 0 0 18 N Hours
2026 - 2 2 18 36 20 0 16 N Hours
2026 - 9 1 18 18 0 0 18 N Hours
2027 - 2 2 18 36 25 0 11 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 0 0 36 N Hours
2028 - 8 1 18 18 0 0 18 N Hours
2028 - 9 1 18 18 0 0 18 N Hours

MA481 (Version: 2014 2) COURSE DETAILS (ARCHIVED)


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.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
Several special problems.

MA481 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA371 2003 1 1 Y

MA481 (Version: 2003 2) COURSE DETAILS (ARCHIVED)


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.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
Several special problems.

MA481 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA371 2003 1 1 Y

MA481 (Version: 1975 1) COURSE DETAILS (ARCHIVED)


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.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
Two special problems.

MA481 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA371 1980 1 1 Y