Class Restriction And Registration Summary

 

EE 60551 - Section 01: Mathematical Programming (CRN 28942)


Course Description:
Theory of constrained optimization complemented by comprehensive computing exercises. Linear programming and convexity. Simplex algorithm. Optimality conditions for nonlinear optimization. Convergence of algorithms. Interior point methods in linear programming. (Alternate spring)

Associated Term: Spring Semester 2013
Campus: Main
Credits: 3
Grade Mode: Standard Letter
Course may not be repeated




Restrictions:
Must be enrolled in one of the following Levels:
Employee Non-Degree (EM) ,  Graduate Non-Degree (GD) ,  Graduate (GR)
Must be enrolled in one of the following Campuses:
Main (M)

Course Attributes:
ZTST - Final exam

Registration Availability (Overflow: Off )
  Maximum Actual Remaining
TOTAL 19 9 10


Enhanced Class Search
Instructor's Description of Course » Antsaklis, Panos » EE  60551 - Section 01:  Mathematical Programming (CRN 28942)
No descriptions have yet been provided for this course and instructor.
Enrollment History » EE 60551 Mathematical Programming (CRN 28942)
Enrollment over the last three years
Course was recently taught in SP11
Average number of students: 12
Composition of Students First Year Soph Junior Senior/5th Grad/Prof
FYS          
Architecture          
Arts and Letters          
Business          
Engineering         100%
Science          
Law          

Was this information helpful?