A piecewise linear convex function is a function that is defined by a set of linear functions, each defined over a different region of the domain. The piecewise linear convex function f:Rn→R can be written as:
f(x)=i=1,…,mmax(ai′x+di) A special case of piecewise linear convex functions is the absolute value function, which is defined by f(x)=∣x∣=max(x,−x).
Piecewise linear convex constraints
Piecewise linear convex constraints are constraints that are defined by a set of piecewise linear convex functions. For example:
minimizesubject toc′xi=1,…,mmax(fi′x+di)≤bAx≥bx≥0 In this case, the constraint maxi=1,…,m(ai′x+di)≤b is a piecewise linear convex constraint. Such constraints are equivalent to a set of linear constraints as follows:
fi′x+di≤b∀i=1,…,m Hence, piecewise linear convex constraints can be reformulated as a set of linear constraints.
Piecewise linear convex objective functions
Piecewise linear convex objective functions are objective functions that are defined by a set of piecewise linear convex functions. Consider the following optimization problem:
minimizesubject toi=1,…,mmax(ci′x+di)Ax≥bx≥0 The objective function of this optimization problem is a piecewise linear convex function. The objective function is equivalent to minimizing z subject to z≥ci′x+di for all i=1,…,m.
Therefore, this optimization problem can be reformulated as follows:
minimizesubject tozz≥ci′x+di∀i=1,…,mAx≥bx≥0