Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...

We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is to decide whether an extension of an ontology is conservative. By varying the language in which ontologies are formulated and the query language that is used to describe consequences, we obtain differ-ent versions o...

A portfolio problem with integer variables can facilitate the use of complex models, including models containing discrete asset values, transaction costs, and logical constraints. This study proposes a distributed algorithm for solving a portfolio program to obtain a global optimum. For a portfolio problem with n integer variables, the objective function first is converted into an ellipse funct...

We study amulti-periodmean-variance portfolio selection problemwith an uncertain time horizon and serial correlations. Firstly, we embed the nonseparablemulti-period optimization problem into a separable quadratic optimization problemwith uncertain exit time by employing the embedding technique of Li and Ng 2000 . Then we convert the later into an optimization problem with deterministic exit ti...

in this paper we try to introduce a new approach and study the notion of efficiency under a multi objectives linear programming problem in the university by using analysis of hierarchy process (ahp)‎. ‎to this end‎, ‎we first extract some effective parameters due to efficiency offices in university and then prioritized these parameters by the ahp method‎. ‎hence‎, ‎we could classify the most im...

the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...