Linear Programming (LP) General form: Canonical form: min cTx s.t. ajx=b i∈M min cTx ax≥b, i∈M → s.t.Ax≥b 为≥0 j∈N x≥0 x;unconstrained j∈N -6-{的0 x;unconstrained→ 5咖e0 (七≥0Linear Programming (LP) min s.t. cTx aT i x = bi aT i x ≥ bi xj ≥ 0 xj unconstrained i ∈ M i ∈ M j ∈ N j ∈ N General form: Canonical form: aT i x = bi ⟹ { aT i x ≥ bi −aT i x ≥ − bi x where j unconstrained ⟹ xj = x+ j − x− j { x+ j ≥ 0 x− j ≥ 0 ⟹ min s.t. cTx Ax ≥ b x ≥ 0