分段线性函数三种MIP模型

2003-MS-Croxton-A Comparison of Mixed-Integer Programming Models for nonconvex piecewise linear cost minimization problems

Definition

g ( x ) : = { f s + c s x , b s − 1 ≤ x ≤ b s , ∀ s ∈ { 1 , 2 , … , S } g(x):=\bigg\{f^s+c^sx,\quad b^{s-1}\le x\le b^{s},\quad \forall s\in \{1,2,\dots,S\} g(x):={ fs+csx,bs−1≤x≤bs,∀s∈{ 1,2,…,S}

• $c^s$ the slope
• $f^s$ the cost-intercept
• $b^{s-1},b^s$ the breakpoints (upper and lower bounds). $b^0=0$

Three Models for Piecewise Linear Costs

• Incremental Model

Define f ^ s = g s ( b s − 1 ) − g s − 1 ( b s − 1 ) = ( f s + c s b s − 1 ) − ( f s − 1 + c s − 1 b s − 1 ) \hat{f}^s=g^s(b^{s-1})-g^{s-1}(b^{s-1})=(f^s+c^sb^{s-1})-(f^{s-1}+c^{s-1}b^{s-1}) f^​