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...

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...

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...

the fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. a linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. in contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...

We derive conditions on the functions ', , v and w such that the 0–1 fractional programming problem max x2f0I1gn 'ıv.x/ ıw.x/ can be solved in polynomial time by enumerating the breakpoints of the piecewise linear functionˆ. / D max x2f0I1gn v.x/ w.x/ on Œ0IC1/. In particular we show that when ' is convex and increasing, is concave, increasing and strictly positive, v and w are supermodular and...

This paper presents fuzzy goal programming approach for bilevel linear fractional programming problem with a single decision maker at the upper level and a single decision maker at the lower level. Here, each level has single objective function, which are fractional in nature and the system constraints are linear functions. In the proposed approach, we first construct fractional membership func...

Definition of dominating function on a fractional graph G has been introduced. Fractional parameters such as domination number and upper defined. Domination with fuzzy Intuitionistic environment, have found by formulating Linear Programming Problem.

In this paper, we introduce a fractional domination game arising from fractional domination problems on graphs and focus on its balancedness and concavity. We first characterize the core of the fractional domination game and show that its core is always non-empty taking use of dual theory of linear programming. Furthermore we study concavity of this game.