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...

Cijeli opis

Bibliografski detalji

Glavni autori:	Doina Ionac, Ştefan Ţigan
Format:	Artigo
Jezik:	Inglês
Izdano:	Publishing House of the Romanian Academy 2004-08-01
Serija:	Journal of Numerical Analysis and Approximation Theory
Teme:	reverse-convex programming max-min programming bilinear fractional programs linear fractional max-min programs
Online pristup:	https://www.ictp.acad.ro/jnaat/journal/article/view/772
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!