| Autor: |
Irwin Greenberg |
| Rok vydání: |
1983 |
| Předmět: |
|
| Zdroj: |
Mathematische Operationsforschung und Statistik. Series Optimization. 14:277-284 |
| ISSN: |
0323-3898 |
| DOI: |
10.1080/02331938308842855 |
| Popis: |
An algorithm is developed which yields the straight lines that bound a set of points from below and from above and which minimizes the sum of the vertical distances from the points to the lines. The algorithm can also be used to construct bounds so that some specified fraction of the points lies between them. The minimization can be expressed as a linear programming problem whose dual contains only two constraints. The two basic variables that result can be obtained and the objective function is easily evaluated. Two examples are given. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
