Abstract
In this paper the finite criss-cross method is generalized to solve hyperbolic programming problems. Just as in the case of linear or quadratic programming the criss-cross method can be initialized with any, not necessarily feasible basic solution. Finiteness of the procedure is proved under the usual mild assumptions. Some small numerical example illustrate the main features of the algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 1-21 |
| Number of pages | 21 |
| Journal | Reports of the Faculty of Technical Mathematics and Informatics |
| Volume | 96 |
| Issue number | 103 |
| Publication status | Published - 31 Oct 1996 |
| Externally published | Yes |
Keywords
- hyperbolic programming
- pivoting
- criss-cross method