Introduction to optimization and operations research

MATH-265

Videos

This page is part of the content downloaded from Videos on Wednesday, 25 December 2024, 18:16. Note that some content and any files larger than 50 MB are not downloaded.

Description

Videos related to the course are available in this channel. It is not required to watch them. They may help if you miss a class.  You will also find the videos on YouTube.

Optimization: Principles and Algorithms

Optimization teaser

28.10.2020, 08:00

Introduction

28.10.2020, 07:57

26070 Exact methods, Gomory cuts

02.07.2019, 17:56

26040 Exact methods, Branch and Bound for integer optimization

02.07.2019, 17:55

26010 Exact methods, Branch and Bound

02.07.2019, 17:54

25110 Discrete optimization, Relaxation

02.07.2019, 17:53

25100 Discrete optimization, The curse of dimensionality

02.07.2019, 17:53

25080 Discrete optimization, Traveling salesman problem

02.07.2019, 17:52

25060 Discrete optimization, Set covering

02.07.2019, 17:48

25040 Discrete optimization, Knapsack

02.07.2019, 17:47

25030 Discrete optimization, Definitions

02.07.2019, 17:47

25020 Discrete optimization, Modeling

02.07.2019, 17:46

23090 Shortest path, PERT

02.07.2019, 17:46

23080 Shortest path, Longest path

02.07.2019, 17:45

23050 Shortest path, Dijkstra's algorithm

02.07.2019, 17:39

23040 Shortest path, Properties of the algorithm

02.07.2019, 17:39

23020 Shortest path, The shortest path algorithm

02.07.2019, 17:38

23010 Shortest path, Properties

02.07.2019, 17:38

22160 The transhipment problem, The assignment problem

02.07.2019, 17:37

22140 The transhipment problem, The transportation problem

02.07.2019, 17:37

22120 The transhipment problem, The maximum flow problem

02.07.2019, 17:37

22100 The transhipment problem, The shortest path problem

02.07.2019, 17:36

22090 The transhipment problem, Total unimodularity of the incidence matrix

02.07.2019, 17:35

22060 The transhipment problem, Total unimodularity

02.07.2019, 17:35

22040 The transhipment problem, Optimality conditions

02.07.2019, 17:34

22030 The transhipment problem, Standard form

02.07.2019, 17:34

22010 Networks, Formulation

02.07.2019, 17:33

21200 Networks, Computer representation

02.07.2019, 17:30

21180 Networks, Costs

02.07.2019, 17:28

21150 Networks, Supply and demand

02.07.2019, 17:25

21130 Networks, Capacities

02.07.2019, 17:23

21110 Networks, Flows

02.07.2019, 17:22

21100 Networks, Properties of trees

02.07.2019, 17:21

21080 Networks, Trees

02.07.2019, 17:21

21070 Networks, Paths and connected components

02.07.2019, 17:20

21050 Networks, Paths

02.07.2019, 17:19

21030 Networks, Cuts

02.07.2019, 17:17

21010 Networks, Definitions

02.07.2019, 17:16

16170 Simplex algorithm, Initial tableau, the general case

02.07.2019, 17:15

16150 Simplex algorithm, Initial tableau, the simple case

02.07.2019, 17:13

16100 Simplex algorithm, Pivoting

02.07.2019, 17:09

16080 Simplex algorithm, Tableau

02.07.2019, 17:08

16040 Simplex algorithm, From vertex to vertex

02.07.2019, 17:08

16020 Simplex algorithm, Graphical method

02.07.2019, 17:07

16010 Simplex algorithm, Solution on a vertex

02.07.2019, 17:06

11180 Descent methods and line search, Newton method with line search

02.07.2019, 17:06

11160 Descent methods and line search, Finiteness of the line search algorithm

02.07.2019, 17:05

11140 Descent methods and line search, Validity of the Wolfe conditions

02.07.2019, 17:04

11120 Descent methods and line search, Second Wolfe condition

02.07.2019, 17:03

11100 Descent methods and line search, First Wolfe condition

02.07.2019, 17:03

11090 Descent methods and line search, Inexact line search

02.07.2019, 17:01

11060 Descent methods and line search, Golden section

02.07.2019, 16:59

11040 Descent methods and line search, Quadratic interpolation

02.07.2019, 16:58

11010 Descent methods and line search, Preconditioned steepest descent

02.07.2019, 16:56

10030 Newton's local method, Geometric interpretation

02.07.2019, 16:54

10010 Newton's local method, Solving the necessary optimality conditions

02.07.2019, 16:53

07030 Solving equations, Newton's method, Convergence

02.07.2019, 16:51

07010 Solving equations, Newton's method, One equation with one variable

02.07.2019, 16:50

06050 Optimality conditions, linear optimization, Strong duality and complementarity slackness

02.07.2019, 16:49

06010 Optimality conditions, linear optimization, Reduced costs

02.07.2019, 16:48

05090 Optimality conditions, unconstrained, Quadratic functions

02.07.2019, 16:47

05050 Optimality conditions, unconstrained, Sufficient optimality conditions

02.07.2019, 16:47

05010 Optimality conditions, unconstrained, Necessary optimality conditions

02.07.2019, 16:46

04050 Duality, Duality in linear optimization

02.07.2019, 16:46

04030 Duality, Lagrangian and dual problem

02.07.2019, 16:45

04010 Duality, Constraint relaxation

02.07.2019, 16:43

03220 Linear constraints, Basic directions

02.07.2019, 16:42

03200 Linear constraints, Degeneracy

02.07.2019, 16:41

03160 Linear constraints, Basic solutions

02.07.2019, 16:39

03120 Linear constraints, Vertices and active constraints

02.07.2019, 16:38

03100 Linear constraints, Elimination of variables

02.07.2019, 16:36

03060 Linear constraints, Feasible directions

02.07.2019, 16:33

03040 Linear constraints, Standard form

02.07.2019, 16:32

03020 Linear constraints, Active constraints

02.07.2019, 16:29

03010 Linear constraints, Polyhedron

02.07.2019, 16:29

02170 Objective function, Preconditioning

02.07.2019, 16:28

02150 Objective function, Linearity and nonlinearity

02.07.2019, 16:27

02090 Objective function, Differentiability, The second order

02.07.2019, 16:26

02040 Objective function, Gradient and descent

02.07.2019, 16:25

02030 Objective function, Differentiability, the first order

02.07.2019, 16:25

02010 Objective function, Convexity

02.07.2019, 16:23

01060 Formulation, Properties

02.07.2019, 16:21

01050 Formulation, Problem définition

02.07.2019, 16:20

01030 Formulation, Problem transformations

02.07.2019, 16:19

01010 Formulation, Modeling

02.07.2019, 16:18

Optimization: Principles and Algorithms

Optimization teaser

28.10.2020, 08:00

Introduction

28.10.2020, 07:57

26070 Exact methods, Gomory cuts

02.07.2019, 17:56

26040 Exact methods, Branch and Bound for integer optimization

02.07.2019, 17:55

26010 Exact methods, Branch and Bound

02.07.2019, 17:54

25110 Discrete optimization, Relaxation

02.07.2019, 17:53

25100 Discrete optimization, The curse of dimensionality

02.07.2019, 17:53

25080 Discrete optimization, Traveling salesman problem

02.07.2019, 17:52

25060 Discrete optimization, Set covering

02.07.2019, 17:48

25040 Discrete optimization, Knapsack

02.07.2019, 17:47

25030 Discrete optimization, Definitions

02.07.2019, 17:47

25020 Discrete optimization, Modeling

02.07.2019, 17:46

23090 Shortest path, PERT

02.07.2019, 17:46

23080 Shortest path, Longest path

02.07.2019, 17:45

23050 Shortest path, Dijkstra's algorithm

02.07.2019, 17:39

23040 Shortest path, Properties of the algorithm

02.07.2019, 17:39

23020 Shortest path, The shortest path algorithm

02.07.2019, 17:38

23010 Shortest path, Properties

02.07.2019, 17:38

22160 The transhipment problem, The assignment problem

02.07.2019, 17:37

22140 The transhipment problem, The transportation problem

02.07.2019, 17:37

22120 The transhipment problem, The maximum flow problem

02.07.2019, 17:37

22100 The transhipment problem, The shortest path problem

02.07.2019, 17:36

22090 The transhipment problem, Total unimodularity of the incidence matrix

02.07.2019, 17:35

22060 The transhipment problem, Total unimodularity

02.07.2019, 17:35

22040 The transhipment problem, Optimality conditions

02.07.2019, 17:34

22030 The transhipment problem, Standard form

02.07.2019, 17:34

22010 Networks, Formulation

02.07.2019, 17:33

21200 Networks, Computer representation

02.07.2019, 17:30

21180 Networks, Costs

02.07.2019, 17:28

21150 Networks, Supply and demand

02.07.2019, 17:25

21130 Networks, Capacities

02.07.2019, 17:23

21110 Networks, Flows

02.07.2019, 17:22

21100 Networks, Properties of trees

02.07.2019, 17:21

21080 Networks, Trees

02.07.2019, 17:21

21070 Networks, Paths and connected components

02.07.2019, 17:20

21050 Networks, Paths

02.07.2019, 17:19

21030 Networks, Cuts

02.07.2019, 17:17

21010 Networks, Definitions

02.07.2019, 17:16

16170 Simplex algorithm, Initial tableau, the general case

02.07.2019, 17:15

16150 Simplex algorithm, Initial tableau, the simple case

02.07.2019, 17:13

16100 Simplex algorithm, Pivoting

02.07.2019, 17:09

16080 Simplex algorithm, Tableau

02.07.2019, 17:08

16040 Simplex algorithm, From vertex to vertex

02.07.2019, 17:08

16020 Simplex algorithm, Graphical method

02.07.2019, 17:07

16010 Simplex algorithm, Solution on a vertex

02.07.2019, 17:06

11180 Descent methods and line search, Newton method with line search

02.07.2019, 17:06

11160 Descent methods and line search, Finiteness of the line search algorithm

02.07.2019, 17:05

11140 Descent methods and line search, Validity of the Wolfe conditions

02.07.2019, 17:04

11120 Descent methods and line search, Second Wolfe condition

02.07.2019, 17:03

11100 Descent methods and line search, First Wolfe condition

02.07.2019, 17:03

11090 Descent methods and line search, Inexact line search

02.07.2019, 17:01

11060 Descent methods and line search, Golden section

02.07.2019, 16:59

11040 Descent methods and line search, Quadratic interpolation

02.07.2019, 16:58

11010 Descent methods and line search, Preconditioned steepest descent

02.07.2019, 16:56

10030 Newton's local method, Geometric interpretation

02.07.2019, 16:54

10010 Newton's local method, Solving the necessary optimality conditions

02.07.2019, 16:53

07030 Solving equations, Newton's method, Convergence

02.07.2019, 16:51

07010 Solving equations, Newton's method, One equation with one variable

02.07.2019, 16:50

06050 Optimality conditions, linear optimization, Strong duality and complementarity slackness

02.07.2019, 16:49

06010 Optimality conditions, linear optimization, Reduced costs

02.07.2019, 16:48

05090 Optimality conditions, unconstrained, Quadratic functions

02.07.2019, 16:47

05050 Optimality conditions, unconstrained, Sufficient optimality conditions

02.07.2019, 16:47

05010 Optimality conditions, unconstrained, Necessary optimality conditions

02.07.2019, 16:46

04050 Duality, Duality in linear optimization

02.07.2019, 16:46

04030 Duality, Lagrangian and dual problem

02.07.2019, 16:45

04010 Duality, Constraint relaxation

02.07.2019, 16:43

03220 Linear constraints, Basic directions

02.07.2019, 16:42

03200 Linear constraints, Degeneracy

02.07.2019, 16:41

03160 Linear constraints, Basic solutions

02.07.2019, 16:39

03120 Linear constraints, Vertices and active constraints

02.07.2019, 16:38

03100 Linear constraints, Elimination of variables

02.07.2019, 16:36

03060 Linear constraints, Feasible directions

02.07.2019, 16:33

03040 Linear constraints, Standard form

02.07.2019, 16:32

03020 Linear constraints, Active constraints

02.07.2019, 16:29

03010 Linear constraints, Polyhedron

02.07.2019, 16:29

02170 Objective function, Preconditioning

02.07.2019, 16:28

02150 Objective function, Linearity and nonlinearity

02.07.2019, 16:27

02090 Objective function, Differentiability, The second order

02.07.2019, 16:26

02040 Objective function, Gradient and descent

02.07.2019, 16:25

02030 Objective function, Differentiability, the first order

02.07.2019, 16:25

02010 Objective function, Convexity

02.07.2019, 16:23

01060 Formulation, Properties

02.07.2019, 16:21

01050 Formulation, Problem définition

02.07.2019, 16:20

01030 Formulation, Problem transformations

02.07.2019, 16:19

01010 Formulation, Modeling

02.07.2019, 16:18