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

Authors:
Vasile Preda;Ioan M. Stancu-Minasian;Miruna Beldiman;Andreea-Madalina Stancu
Affiliations:
Department of Mathematics and Computer Science, Bucharest University, 14 Academiei Street, 010014 Bucharest, Romania and Institute for Mathematical Statistics and Applied Mathematics of the Romani ...;Institute for Mathematical Statistics and Applied Mathematics of the Romanian Academy, Calea 13 Septembrie nr. 13, 050711 Bucharest, Romania;Institute for Mathematical Statistics and Applied Mathematics of the Romanian Academy, Calea 13 Septembrie nr. 13, 050711 Bucharest, Romania;Institute for Mathematical Statistics and Applied Mathematics of the Romanian Academy, Calea 13 Septembrie nr. 13, 050711 Bucharest, Romania
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2011

Citing 4
Cited 0

Simulation and optimization in production planning: a case study

Decision Support Systems
Duality for Multiple Objective Fractional Subset Programming with Generalized (, ρ, σ, θ)-V-Type-I Functions

Journal of Global Optimization
Generalized V-univexity type-I for multiobjective programming with n-set functions

Journal of Global Optimization
Design and Analysis of Simulation Experiments

Design and Analysis of Simulation Experiments

Quantified Score

Hi-index	0.98

Visualization

Abstract

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.