Course ID:
Course Code & Number
IE 533
Course Title
Deterministic Optimization
Level
MS
Credit Hours/ ECTS Credits
(3+0+0) 3 TEDU Credits, 7.5 ECTS Credits
Year of Study:
Semester:
Type of Course:
Mode of Delivery:
Language of Instruction:
Pre-requisite / Co-requisite:
Pre-requisites: NONE
Co-requisites: NONE
Catalog Description
Convex analysis and polyhedral sets; Modeling linear programming problems; The Simplex method; Duality theory and sensitivity analysis; The revised simplex method and Farkas’ Lemma; Modeling, relaxing and bounding techniques; Fundamental easy-to-solve problems; Branch and bound, cutting planes, branch and price, and column generation methods; Nonlinear optimization basics and Karush–Kuhn–Tucker conditions.
Course Objectives
Software Usage
Course Learning Outcomes
Learning Activities and Teaching Methods:
Assessment Methods and Criteria:
Assessment Methods and Criteria Others:
Design Content
Recommended Reading
Required Reading
Grading
Learning Activities and Teaching Methods Others:
Course Coordinator:
Student Workload:
| Workload | Hrs |
|---|
Course & Program Learning Outcome Matching: