Description
Systems of linear inequalities, formulation of linear programming problems, geometric method, the simplex method, duality theory, complementary slackness, sensitivity analysis, branch-and-bound method and cutting plane method for integer linear programming, applications and extensions.
Prerequisites
- Prerequisite(s): MATH 2152 or MATH 2107 , or permission of the School.
Conditions and arrangements
- Precludes additional credit for Precludes additional credit for ECON 4004 , SYSC 3200 .
- Prerequisite(s): MATH 2152 or MATH 2107 , or permission of the School.
- Lectures three hours a week and one hour tutorial.
Reference text in its original language
Systems of linear inequalities, formulation of linear programming problems, geometric method, the simplex method, duality theory, complementary slackness, sensitivity analysis, branch-and-bound method and cutting plane method for integer linear programming, applications and extensions.
- Prerequisite(s): MATH 2152 or MATH 2107 , or permission of the School.
- Precludes additional credit for Precludes additional credit for ECON 4004 , SYSC 3200 .
- Lectures three hours a week and one hour tutorial.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/MATH/