in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

1. Complementary systems. We say that two proof systems are complementary iff what can be derived in one system is precisely that which cannot be derived in the other, and vice versa [11]. For instance, classical propositional logic and Łukasiewicz's rejection calculus [5] are complementary. If we focus on decid-able logics, given one system there exist of course many algorithms to compute what...

abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...

abstract regarding the imprecise or fuzzy data on the agriculture activities, applying models based on fuzzy data may be useful. in line with this condition this study tries to compare the ability of possiblistic programming approach in developing optimal solution with fuzzy and deterministic programming. to get this objective a data set obtained from 90 farmers of kohgilooye region, gathered i...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Currently, eating disorders (ED) refers to as «diseases of civilization» and the most important component in the development and progression of obesity in all age groups. Many studies conducted in the Americas, Europe, Russia indicate the increasing role of food programming, which is the basis for the formation of ED and determines the characteristics of the metabolism of an individual, the wei...

We describe an approximate dynamic programming algorithm for partially observable Markov decision processes represented in factored form. Two complementary forms of approximation are used to simplify a piecewise linear and convex value function, where each linear facet of the function is represented compactly by an algebraic decision diagram. ln one form of approximation, the degree of state ab...