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.
|Number of pages||21|
|Journal||Reports of the Faculty of Technical Mathematics and Informatics|
|Publication status||Published - 31 Oct 1996|
- hyperbolic programming
- criss-cross method
Illés, T., Szirmai, Á., & Terlaky, T. (1996). The finite criss-cross method for hyperbolic programming. Reports of the Faculty of Technical Mathematics and Informatics, 96(103), 1-21. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.6681&rep=rep1&type=pdf