On a general duality model in multiobjective fractional programming with n-set functions

Autor:	Andreea-Madalina Stancu, Vasile Preda, Miruna Beldiman, I. M. Stancu-Minasian
Rok vydání:	2011
Předmět:	Combinatorics Quasiconvex function Fractional programming Sublinear function Set function Modeling and Simulation Regular polygon Duality (optimization) Function (mathematics) Convexity Computer Science Applications Mathematics
Zdroj:	Mathematical and Computer Modelling. 54:490-496
ISSN:	0895-7177
DOI:	10.1016/j.mcm.2011.02.039
Popis:	We consider some types of generalized convexity and discuss duality results for a fractional programming problem involving (F,b,@f,@r,@q)-univex n-set functions. Almost all results presented until now in the literature were obtained under the assumption that the function F is sublinear or, in the last time, convex in the third argument. In our approach, we suppose that F is a quasiconvex function in the third argument.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::ee2e1cd252557170fdbbb7c6ee2fbd99 https://doi.org/10.1016/j.mcm.2011.02.039 Zobrazit plný text záznamu Full Text from ScienceDirect