Completed
Solving dual LP problems: Optimality conditions
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
HiGHS - Theory, Software and Impact
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 HIGHS: The team
- 3 HIGHS: Solvers
- 4 Practical LP problems
- 5 Solving primal LP problems: Optimality conditions
- 6 Solving dual LP problems: Optimality conditions
- 7 Dual simplex algorithm: Choose a row
- 8 Dual simplex algorithm: Choose a column
- 9 Dual simplex algorithm: Data required
- 10 Solving LP problems: Primal or dual simplex?
- 11 Simplex method: Computation
- 12 Hyper-sparsity: Solve Bx=r for sparser
- 13 Hyper-sparsity: Inverse of a sparse matrix
- 14 Hyper-sparsity: Solving Lx = b
- 15 Hyper-sparsity: Other components
- 16 Hyper-sparsity: Effectiveness
- 17 Parallel solution of structured LP problems
- 18 Parallel solution of stochastic MIP problems
- 19 PIPS-S: Exploiting problem structure
- 20 PIPS-S: Overview
- 21 PIPS-S: Results
- 22 Parallel solution of general LP problems via multiple iterations
- 23 pani: Effectiveness
- 24 HiGHS: Performance
- 25 HiGHS: Simplex performance
- 26 HiGHS: Interior point performance
- 27 HIGHS: MIP performance
