Abstract:Airline hub location selection problems have become one of the most popular and important issues not only in the truck transportation and the marine transportation, but also in the air transportation. There are different methods for selecting hub location, however, they are mostly dependent on engineer decision making and need for high cost. In this paper, a method of rules extraction for site hub location based on rough set theory and decision network is proposed. The information system attributes are firstly… Show more
“…They transformed the original interval LP into two LPs with crisp coefficients. In this section, we consider an interval LP problem as follows: Now, we quote some definitions and theorems from Chinneck and Ramadan [4] for maximization Problem (1). Consider the i − th inequality in (1) as follows:…”
Section: Linear Programming With Interval Coefficientsmentioning
confidence: 99%
“…, n. Then, n j=1ā ij x j ≤ b i and n j=1 a ij x j ≤b i are the minimum value range and maximum value range inequalities, respectively. (1). Then, for any given feasible solution x = (x 1 , x 2 , .…”
Section: Example 31 Let Us Consider the Following Interval Inequalitymentioning
confidence: 99%
“…s.t. [1,3], [1,3] x 1 + [2, 4], [1,5] x 2 ≤ [7,9], [5,10] [2, 3], [1,5] [3,9] x 1 , x 2 ≥ 0. 3,9] x 1 , x 2 ≥ 0, …”
Section: ) If Lpic Problem (19) Is Infeasible Then Lpricmentioning
confidence: 99%
“…It is due to the fact that some of relevant data are inexistent, scarce, or difficult to obtain [7][8][9]11]. engineering [1] and among others. In recent decade, some works have been developed on rough programming [14].…”
In this paper, a linear programming (LP) problem is considered where some or all of its coefficients in the objective function and/or constraints are rough intervals. In order to solve this problem, we will construct two LP problems with interval coefficients. One of these problems is an LP where all of its coefficients are upper approximations of rough intervals and the other is an LP where all of its coefficients are lower approximations of rough intervals. Via these two LPs, two newly solutions (completely and rather satisfactory) are defined. Some examples are given to demonstrate the results.
“…They transformed the original interval LP into two LPs with crisp coefficients. In this section, we consider an interval LP problem as follows: Now, we quote some definitions and theorems from Chinneck and Ramadan [4] for maximization Problem (1). Consider the i − th inequality in (1) as follows:…”
Section: Linear Programming With Interval Coefficientsmentioning
confidence: 99%
“…, n. Then, n j=1ā ij x j ≤ b i and n j=1 a ij x j ≤b i are the minimum value range and maximum value range inequalities, respectively. (1). Then, for any given feasible solution x = (x 1 , x 2 , .…”
Section: Example 31 Let Us Consider the Following Interval Inequalitymentioning
confidence: 99%
“…s.t. [1,3], [1,3] x 1 + [2, 4], [1,5] x 2 ≤ [7,9], [5,10] [2, 3], [1,5] [3,9] x 1 , x 2 ≥ 0. 3,9] x 1 , x 2 ≥ 0, …”
Section: ) If Lpic Problem (19) Is Infeasible Then Lpricmentioning
confidence: 99%
“…It is due to the fact that some of relevant data are inexistent, scarce, or difficult to obtain [7][8][9]11]. engineering [1] and among others. In recent decade, some works have been developed on rough programming [14].…”
In this paper, a linear programming (LP) problem is considered where some or all of its coefficients in the objective function and/or constraints are rough intervals. In order to solve this problem, we will construct two LP problems with interval coefficients. One of these problems is an LP where all of its coefficients are upper approximations of rough intervals and the other is an LP where all of its coefficients are lower approximations of rough intervals. Via these two LPs, two newly solutions (completely and rather satisfactory) are defined. Some examples are given to demonstrate the results.
“…Rough set theory has a large application in different fields such as knowledge acquisition, decision analysis, machine learning, civil engineering problems and decision algorithms etc. For details, see [9,10,11,12]. Robolledo [13] in his research given the basic concept and definitions of rough intervals.…”
The aim of this article is to propose a novel and simple technique for solving bi-matrix games with rough intervals payoffs. Since the payoffs of the rough bi-matrix games are rough intervals, then its value is also a rough interval. In this technique, we derived four bilinear programming problems, which are used to obtain the upper lower bound, lower lower bound, lower upper bound and upper upper bound of the rough interval values of the players in rough bi-matrix games which we called in this article as 'solution space'. Moreover, the expected value operator and trust measure of rough interval have been used to find the α-trust equilibrium strategies and the expected equilibrium strategies of rough interval bi-matrix games. Finally, numerical example of tourism planning management model is presented to illustrate the methodologies adopted and solution procedure.
In this paper, we concentrate on solving the zero-sum two-person continuous differential games using rough programming approach. A new class defined as rough continuous differential games is resulted from the combination of rough programming and continuous differential games. An effective and simple technique is given for solving such problem. In addition, the trust measure and the expected value operator of rough interval are used to find the α-trust and expected equilibrium strategies for the rough zero-sum two-person continuous differential games. Moreover, sufficient and necessary conditions for an open loop saddle point solution of rough continuous differential games are also derived. Finally, a numerical example is given to confirm the theoretical results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.