An approach for solving the multi-criteria fractional convex programming problem
Închide
Articolul precedent
Articolul urmator
345 11
Ultima descărcare din IBN:
2022-12-03 19:09
SM ISO690:2012
SOLOMON, Dumitru. An approach for solving the multi-criteria fractional convex programming problem. In: Mathematics and IT: Research and Education, 1-3 iulie 2021, Chişinău. Chișinău, Republica Moldova: 2021, pp. 78-79.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Mathematics and IT: Research and Education 2021
Conferința "Mathematics and IT: Research and Education "
Chişinău, Moldova, 1-3 iulie 2021

An approach for solving the multi-criteria fractional convex programming problem


Pag. 78-79

Solomon Dumitru
 
Vladimir Andrunachievici Institute of Mathematics and Computer Science
 
 
Disponibil în IBN: 1 iulie 2021


Rezumat

This presentation is concerned with studying and solving the following generalized multi-criteria fractional convex programming problem [1]:  formulawhere the functions  formula  are continuous, convex and differentiable in Rn. We show that for this multi-criteria fractional convex programming problem three possible aggregation procedures can be applied that allow to obtain the following auxiliary generalized fractional-convex programming problems: formula  This means that the solutions of the considered multi-criteria fractional convex programming problem can be obtained by using the solutions of the auxiliary generalized fractional-convex programming problems above. The question which problem should be used for determining the solution of the multi-criteria problem is discussed in [1]. The proposed aggregation procedure for solving the multi-criteria problems (1),(2) can be applied also by using other equivalent fractional programming problems. In a detailed form how to determine the solutions of different classes of fractional programming problems can be found in [1].