LISTEN
Course Catalog
Course Catalog
IE 501 Linear Programming and Extensions
3 Credits
Theory of linear programming; convexity; simplex and
algorithmic aspects; duality and sensitivity; computational
issues; decomposition and column generation; introduction
to integer and nonlinear programming.
Last Offered Terms
Course Name
SU Credit
Fall 2022-2023
Linear Programming and Extensions
3
Fall 2021-2022
Linear Programming and Extensions
3
Fall 2020-2021
Linear Programming and Extensions
3
Fall 2019-2020
Linear Programming and Extensions
3
Fall 2018-2019
Linear Programming and Extensions
3
Fall 2017-2018
Linear Programming and Extensions
3
Fall 2016-2017
Linear Programming and Extensions
3
Fall 2015-2016
Linear Programming and Extensions
3
Fall 2014-2015
Linear Programming and Extensions
3
Fall 2013-2014
Linear Programming and Extensions
3
Fall 2012-2013
Linear Programming and Extensions
3
Fall 2011-2012
Linear Programming and Extensions
3
Fall 2010-2011
Linear Programming and Extensions
3
Fall 2009-2010
Linear Programming and Extensions
3
Fall 2008-2009
Linear Programming and Extensions
3
Fall 2007-2008
Linear Programming and Extensions
3
Fall 2006-2007
Linear Programming and Extensions
3
Fall 2005-2006
Linear Programming and Extensions
3
Fall 2004-2005
Linear Programming and Extensions
3
Fall 2003-2004
Linear Programming and Extensions
3
Fall 2002-2003
Linear Programming and Extensions
3
Fall 2001-2002
Linear Programming and Extensions
3
Fall 2000-2001
Linear Programming and Extensions
3
Prerequisite: __
Corequisite: __
ECTS Credit: 10 ECTS (10 ECTS for students admitted before 2013-14 Academic Year)
General Requirements:
IE 501 Linear Programming and Extensions | 3 Credits | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Theory of linear programming; convexity; simplex and algorithmic aspects; duality and sensitivity; computational issues; decomposition and column generation; introduction to integer and nonlinear programming. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Prerequisite: __ | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Corequisite: __ | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
ECTS Credit: 10 ECTS (10 ECTS for students admitted before 2013-14 Academic Year) | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
General Requirements: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||