SC/MATH-3171 3.00:Linear-Optimization

Course Description:

Introduces students to linear optimization (linear programming), including the problem formulation, simplex method, LP-duality theory, sensitivity analysis, and its business and industrial applications. Prerequisites: SC/MATH 1021 3.00 or SC/MATH 1025 3.00 or SC/MATH 2221 3.00. Course credit exclusions: AP/ECON 3120 3.00, AP/ADMS 3331 3.00, AP/ADMS 3351 3.00, GL/MATH 3660 6.00, SC/MATH 3170 6.00 (prior to Winter 2016).

Language of Instruction:

English

Term F     Section A     Please click here to see availability. Section Director: Mohammad Reza Peyghami Type Day Start Time Duration Location Cat # Instructor Notes/Additional Fees LECT 01 T 10:00 90   R 10:00 90   C32N01 Mohammad Reza Peyghami This course will be offered through remote/online delivery and can have synchronous sessions during the day and time noted.

---

Professor Mohammad Reza Peyghami(Fall 2020 MATH 3171)

Linear Optimization

• Email:rpeygham@yorku.ca 
• Position:Instructor(Research Associate)

——————————————————————————————————————–

• https://github.com/s000ys/MATH-3171
• https://gitlab.com/s000ys/MATH-3171
• https://bitbucket.com/s000ys/MATH-3171
• https://kaggle.com/s000ys/MATH-3171

---

Video Archives(Only DUE TO SCHOOL ALLOWED TO CLOSE BY GOVERNMENT)

https://s000ys.workplace.com/groups/404871793876561

——————————————————————————————————————-

Course Materials

https://data.mendeley.com/datasets/37yzn7fsvf/draft?a=64ca0b5e-60a6-47f0-8d54-1500e7a3c9e6