In piece- wise linear programming (PLP), the objective function is convex and piece- wise linear, and the constraints are linear. The paper describes the PLP algorithm in detail and discusses the advantages of this technique over linear programming.
|Journal||ASME Pap 71-Vibr122 for meeting|
|Publication status||Published - Jan 1 1971|
ASJC Scopus subject areas