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

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

The proper ratio decision of sintering burden is a significant section for both of decreasing sintering costs and increasing quality of iron. At present most company in China take the Fixed-ratio method and linear programming (LP) model to calculate the proper ratio for sintering. The former is the performance appraisal method for production cost management of iron. The latter is to use maths m...

Resilience is commonly portrayed as a positive capability that allows individuals, groups, and organizations to thrive in dynamic contexts.This paper questions this oversimplified view based on a dialectical analysis of a telehealth innovation within a network of collaborating hospitals. We analyze the major contradictions that characterize the adoption of the innovation. First, we analyze cont...

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, using the idea of convexificators, we study boundedness and nonemptiness of Lagrange multipliers satisfying the first order necessary conditions. We consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. Within this context, define generalized Mangasarian-Fromovitz constraint qualification and sh...