Some procedures for solving special max-min fractional rank-two reverse-convex programming problems
In this paper we suggest some procedures for solving two special classes of \(\max\)-\(\min\) fractional reverse-convex programs. We show that a special bilinear fractional max-min reverse-convex program can be solved by a linear reverse-convex programming problem. For a linear fractional max-min re...
| Auteurs principaux: | , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Publishing House of the Romanian Academy
2004-08-01
|
| Collection: | Journal of Numerical Analysis and Approximation Theory |
| Sujets: | |
| Accès en ligne: | https://ictp.acad.ro/jnaat/journal/article/view/772 |