## 2016-02-22

### 線性規劃--方述誠 / 交大

# 播放清單 (請按影片的右上角選取)

source: nctuocw     Last updated on 2014年5月20日
This course provides the fundamental understanding to the theory and algorithms of linear optimization. It involves mathematical analysis, theorem proving, algorithm design and numerical methods.

Lec01 線性規劃 第一講 Examples of LP problems、Mastering LP、Basic terminologies、Hyperplanes, halfspaces, and polyhedral sets、Affine sets, convex sets, and cones、Extreme points and basic feasible solutions 3:38:47
Lec02 線性規劃 第二講 Nondegeneracy and adjacency、Resolution theorem for convex polyhydrons、Fundamental theorem of linear programming 3:01:09
Lec03 線性規劃 第三講 Elements of iterative scheme、Basics of the simplex methods、Algebra of the simplex method 3:05:02
Lec04 線性規劃 第四講 Starting the simplex method、Degeneracy and cycling、The revised simplex method 4:42:52
Lec05 線性規劃 第五講 Dual linear program、Duality theory、Complementary slackness and optimality conditions、An economic interpretation of the dual problems 3:33:26
Lec06 線性規劃 第六講 The dual simplex method、Sensitivity analysis 2:58:42
Lec07 線性規劃 第七講 The primal dual simplex method 2:44:44
Lec08 線性規劃 第八講 Primal affine scaling algorithm、Dual affine scaling algorithm、Primal-Dual affine scaling algorithm 2:28:13
Lec09 線性規劃 第九講 Moving along different algebraic paths、Extensions of algebraic paths、Geometric interpretation of the moving directions 1:23:34