Detailed Course Information |
2024 Fall
Jan 15, 2025 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| MATH 329 - Linear and Discrete Optimization |
|
A course in the theory and techniques of linear programming; convexity and extreme points of polyhedral sets, the simplex method, duality and selected applications will be covered.
***Prerequisite: CS 110, MATH 122 and MATH 221 or permission of Department Head.***
0.000 OR 3.000 Credit hours 3.000 Lecture hours 1.000 Lab hours Levels: Undergraduate Schedule Types: Lecture, Lab, Examination Mathematics & Statistics Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate |
| Return to Previous | New Search |
|