Part1 : Linear programming and Its geometry
problem in Linear programming
general form:
standard form:
reduction to standard form:
method 1: $write\ x=x±x-, x+=max{0,x},x-=-min{0,x} $
method 2: ∑ i = 1 n a i x i < = b → ∑ i = 1 n a i x i + s = b & s ≥ 0 \sum^n_{i=1}a_ix_i<=b \rightarrow \sum^n_{i=1}a_ix_i+s=b\ \& s\ge0 ∑i
最低0.47元/天 解锁文章
扫一扫
416
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
