Özet:

We consider fractional maximization and minimization problems with an arbitrary feasible set, with a convex function in the numerator, and with a concave function in the denominator. These problems have many applications in economics and engineering. It has been shown that both of kind of problems belongs to a class of global optimization problems. These problems can be treated as quasiconvex maximization and minimization problems under certain conditions. For such problems we use the approach developed earlier. The approach based on the special Global Optimality Conditions according to the Global Search Theory proposed by A. S. Strekalovsky. For the case of convex feasible set, we reduce the original minimization problem to pseudoconvex minimization problem showing that any local solution is global. On this basis, two approximate numerical algorithms for fractional maximization and minimization problems are developed. Successful computational experiments have been done on some test problems with a dimension up to 1000 variables.

Anahtar Kelimeler: