— Optimization
Linear programming, simplex method. Basic properties of unconstrained nonlinear problems, descent methods, conjugate direction method. Constrained minimization. Programming language required.
Prerequisites & course information
Course Description: Linear programming, simplex method. Basic properties of unconstrained nonlinear problems, descent methods, conjugate direction method. Constrained minimization. Programming language required. Learning Activities: Web Virtual Lecture 3 hour(s), Web Electronic Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Applied Mathematics, Mathematics, Mathematics & Scientific Computation, Mathematical Analytics & Operations Research, Statistics, and Data Science majors. Grade Mode: Letter. General Education: Science & Engineering (SE). This course version is effective from, and including: Winter Quarter 2027. Learning Activities: Web Virtual Lecture 3 hour(s), Web Electronic Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Applied Mathematics, Mathematics, Mathematics & Scientific Computation, Mathematical Analytics & Operations Research, Statistics, and Data Science majors. Grade Mode: Letter. General Education: Science & Engineering (SE).
Sources
- Course catalogue ↗2026-2027