MIE1653H: Integer Programming Applications

Formulation of integer programming problems and the characterization of optimization problems representable as integer and mixed-integer programs. The degree of difficulty of classes of integer programs and its relation to the structure of their feasible sets. Optimality conditions. Branchand-bound, cutting plane, and decomposition methods for obtaining solutions or approximating solutions.

Credit Value (FCE)

0.50

Campus(es)

St. George

School of Graduate Studies University of Toronto 63 St. George Street Toronto, ON Canada M5S 2Z9
Tel: 416-978-6614

Calendar Contacts
Feedback
Accessibility

Traditional Land Acknowledgement

We wish to acknowledge this land on which the University of Toronto operates. For thousands of years it has been the traditional land of the Huron-Wendat, the Seneca, and the Mississaugas of the Credit. Today, this meeting place is still the home to many Indigenous people from across Turtle Island and we are grateful to have the opportunity to work on this land.