Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

•Novel hierarchical and compact MILP formulation for piecewise linear approximation.•Formulation minimizes sequentially number of segments and approximation error.•Fast binary search algorithm identifies tightening bounds.•Fast algorithm identifies feasible warm starting solution.•Solution time two...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 315; číslo 1; s. 50 - 62
Hlavní autor: Ploussard, Quentin
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States Elsevier B.V 16.05.2024
Elsevier
Témata:
Hierarchical optimization
Integer programming
Linear programming
Piecewise linear approximation
Integer programming
Linear programming
Hierarchical optimization
Piecewise linear approximation
ISSN:0377-2217
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Novel hierarchical and compact MILP formulation for piecewise linear approximation.•Formulation minimizes sequentially number of segments and approximation error.•Fast binary search algorithm identifies tightening bounds.•Fast algorithm identifies feasible warm starting solution.•Solution time two orders of magnitude less than existing literature for large sets. In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate non-linear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.
Bibliografie:AC02-06CH11357
USDOE Office of Science (SC)
USDOE Laboratory Directed Research and Development (LDRD) Program
None
ISSN:0377-2217
DOI:10.1016/j.ejor.2023.11.017