You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
Remix and Share
-
(Complete Item Description)
- Abstract:
This course is designed to introduce first-year Sloan students to the fundamental techniques of using data to make informed management decisions. In particular, we will focus on various ways of modeling, or thinking structurally about, decision problems in order to enhance decision-making skills.
- Subject:
- Business
- Grade Level:
- Post-secondary
- Collection:
-
MIT OpenCourseWare
Remix and Share
-
(Complete Item Description)
- Abstract:
This course is an introduction to linear optimization and its extensions emphasizing the underlying mathematical structures, geometrical ideas, algorithms and solutions of practical problems. The topics covered include: formulations, the geometry of linear optimization, duality theory, the simplex method, sensitivity analysis, robust optimization, large scale optimization network flows, solving problems with an exponential number of constraints and the ellipsoid method, interior point methods, semidefinite optimization, solving real world problems problems with computer software, discrete optimization formulations and algorithms.
- Subject:
- Mathematics and Statistics, Science and Technology
- Grade Level:
- Post-secondary
- Collection:
-
MIT OpenCourseWare
Remix and Share
-
(Complete Item Description)
- Abstract:
This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods.
- Subject:
- Mathematics and Statistics, Science and Technology
- Grade Level:
- Post-secondary
- Collection:
-
MIT OpenCourseWare
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
