Piecewise-Linear Approximations of Multidimensional Functions
We develop explicit, piecewise-linear formulations of functions f ( x ):ℝ n ↦ ℝ, n ≤3, that are defined on an orthogonal grid of vertex points. If mixed-integer linear optimization problems (MILPs) involving multidimensional piecewise-linear functions can be easily and efficiently solved to global o...
Saved in:
| Published in: | Journal of optimization theory and applications Vol. 145; no. 1; pp. 120 - 147 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Boston
Springer US
01.04.2010
Springer Springer Nature B.V |
| Subjects: | |
| ISSN: | 0022-3239, 1573-2878 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We develop explicit, piecewise-linear formulations of functions
f
(
x
):ℝ
n
↦
ℝ,
n
≤3, that are defined on an orthogonal grid of vertex points. If mixed-integer linear optimization problems (MILPs) involving multidimensional piecewise-linear functions can be easily and efficiently solved to global optimality, then non-analytic functions can be used as an objective or constraint function for large optimization problems. Linear interpolation between fixed gridpoints can also be used to approximate generic, nonlinear functions, allowing us to approximately solve problems using mixed-integer linear optimization methods. Toward this end, we develop two different explicit formulations of piecewise-linear functions and discuss the consequences of integrating the formulations into an optimization problem. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0022-3239 1573-2878 |
| DOI: | 10.1007/s10957-009-9626-0 |