Range of optimal values in absolute value linear programming with interval data
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908577477689344 |
|---|---|
| author | Hladík, Milan |
| author_facet | Hladík, Milan |
| contents | Absolute value linear programming problems is quite a new area of optimization problems, involving linear functions and absolute values in the description of the model. In this paper, we consider interval uncertainty of the input coefficients. Our goal is to determine the best and the worst case optimal values. For the former, we derive an explicit formula, reducing the problem to a certain optimization problem. However, the latter is more complicated, and we propose a lower and upper bound approaches to estimate the value. We also investigate the basis stability, in which situation the best case optimal value is efficiently computable. The worst case optimal value then also admits a simple characterization; however, the computational complexity remains open. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_04604 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Range of optimal values in absolute value linear programming with interval data Hladík, Milan Optimization and Control 90C30, 90C26, 65G40 Absolute value linear programming problems is quite a new area of optimization problems, involving linear functions and absolute values in the description of the model. In this paper, we consider interval uncertainty of the input coefficients. Our goal is to determine the best and the worst case optimal values. For the former, we derive an explicit formula, reducing the problem to a certain optimization problem. However, the latter is more complicated, and we propose a lower and upper bound approaches to estimate the value. We also investigate the basis stability, in which situation the best case optimal value is efficiently computable. The worst case optimal value then also admits a simple characterization; however, the computational complexity remains open. |
| title | Range of optimal values in absolute value linear programming with interval data |
| topic | Optimization and Control 90C30, 90C26, 65G40 |
| url | https://arxiv.org/abs/2510.04604 |