BitTorrent is a peer-to-peer computer network protocol for sharing content in an efficient and scalable way. Modeling and analysis of the popular private BitTorrent communities has become an active area of research. In these communities users are strongly incentivized to contribute their resources, i.e., to share their files. In BitTorrent terminology, users who have finished downloading files ...

Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming. In this work, we develop a branch and cut algorithm based on continuous fractional optimization, for generating the whole integer efficient solutions of the MOILFP problem. The basic idea of...

Optimization of the ratio of two functions is called fractional programming or ratio optimization problem. If one can optimize simultaneously collection of fractional objective functions then the problem is called multi-objective fractional programming. This paper presents a survey on fractional programming problems. In contrast, this survey excludes many of the technical details and provides a...

In this paper we consider the solution methods for mixed-integer linear fractional programming (MILFP) models, which arise in cyclic process scheduling problems. We first discuss convexity properties of MILFP problems, and then investigate the capability of solving MILFP problems with MINLP methods. Dinkelbach's algorithm is introduced as an efficient method for solving large scale MILFP proble...

Many forensic genetics problems can be handled using structured systems of discrete variables, for which Bayesian networks offer an appealing practical modelling framework, and allow inferences to be computed by probability propagation methods. However, when standard assumptions are violated for example when allele frequencies are unknown, there is identity by descent or the population is heter...

In this paper we present a new feasible direction method to find all efficient extreme points for bi criterion linear fractional programming problems. This method is based on the conjugate gradient projection method. An initial feasible point is used to generate all efficient extreme points for this problem through a sequence of feasible directions of movement. Since methods based on vertex inf...

where An is the n-fold product of the σ-algebra A of subsets of a given set X , Fi, Gi, i∈ p ≡ {1,2, . . . , p}, and Hj , j ∈ q, are real-valued functions defined on An, and for each i∈ p, Gi(S) > 0 for all S∈An such that Hj(S) ≤ 0, j ∈ q. Optimization problems of this type in which the functions Fi, Gi, i∈ p, and Hj , j ∈ q, are defined on a subset of Rn (n-dimensional Euclidean space) are cal...

Many forensic genetics problems can be handled using structured systems of discrete variables, for which Bayesian networks offer an appealing practical modeling framework, and allow inferences to be computed by probability propagation methods. However, when standard assumptions are violated—for example, when allele frequencies are unknown, there is identity by descent or the population is heter...

This paper presents a fuzzy goal programming FGP procedure for solving bilevel multiobjective linear fractional programming BL-MOLFP problems. It makes an extension work of Moitra and Pal 2002 and Pal et al. 2003 . In the proposed procedure, the membership functions for the defined fuzzy goals of the decision makers DMs objective functions at both levels as well as the membership functions for ...

In this paper, a multi-objective intuitionistic fuzzy linear fractional programm ing problem is discussed with two different methods namely Kanti Swarup’s Fractional algorithm and weighting factor method in which the constraints are triangular intuitionistic fuzzy number. The optimal solutions are verified for the proposed methods. Numerical examples are provided to check the feasibility of the...