IE3011: Optimization Models and Methods

4 CreditsGoal 10 - People/EnvironmentGoal 6 - Hum: Arts/Lit/PhilOnline Available

Linear, nonlinear, integer, and network optimization models and their tractability; Sensitivity analysis; Solution with software; Introduction to solution methods; Simplex method and Dijkstra’s algorithm. prereq: MATH 2374, MATH 2142, or equivalent, Upper Division CSE

View on University Catalog

All Instructors

B Average (2.989)Most Common: B (16%)

This total also includes data from semesters with unknown instructors.

560 students
SNWFDCBA

  • 3.92

    /5

    Recommend

  • 3.39

    /5

    Effort

  • 4.37

    /5

    Understanding

  • 4.02

    /5

    Interesting

  • 4.10

    /5

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2024 provided by the Office of Institutional Data and Research

      Privacy Policy