In piece-wise linear programming (PLP), the objective function is convex and piece-wise linear and the constraints are linear. The PLP algorithm is described in detail and the advantages of this technique over linear programming are discussed.

This content is only available via PDF.
You do not currently have access to this content.