This model considers the strategy that supplier offers retailer a full trade-credit policy whereas retailer offers their customers a partial trade-credit policy. For such assumption, retailer can earn more profits. In...
详细信息
In this paper, a supplier selection model was developed for a retailer. Suppliers have different influence factors that have a risk of profit loss or less profit as well as a loss of goodwill to a retailer. Thus, a re...
详细信息
In this paper, a supplier selection model was developed for a retailer. Suppliers have different influence factors that have a risk of profit loss or less profit as well as a loss of goodwill to a retailer. Thus, a retailer must choose a supplier that can provide better profit and better goodwill. Different suppliers have different business policies. Here, different risk factors and their corresponding severity in profit loss and goodwill loss are considered as a fuzzy number. Next, the total risk in profit loss and goodwill loss is formulated. To select a supplier with the minimum risk, a balanced solution of the soft set theory was applied to a numerical example.
In a congested road network, it is always desirable to find a reliable shortest path so far as travel time is concerned. Physical distance and travel time are invariably uncertain due to large-scale maintenance work, ...
详细信息
The shortest-paths problem is an important problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in ...
详细信息
The shortest-paths problem is an important problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The Shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one node to another often gives the best way to route message between the nodes. This paper presents an O(n 2 ) time algorithm for solving all pairs shortest path problems on trapezoid graphs which are extensions of interval graphs and permutation graphs. The space complexity of this algorithm is of O(n 2 ). This problem has been solved by constructing n breadth-first search (BFS) trees with each of the n vertices as root. As the lower bound of time complexity for computing the all pairs shortest paths is known to be of O(n 2 ), this proposed algorithm is optimal.
In this paper, bipolar fuzzy planar graph is defined and studied several properties. The bipolar fuzzy planar graph is defined in a very interesting way. The parameter "degree of planarity" measures the plan...
详细信息
Recently, in Mathematical and Computational Applications Journal Chiu et al. [1] and Chen and Chiu [2] propose an inventory model based on EPQ with rework to determine the replenishment lot size and the number of ship...
详细信息
Recently, in Mathematical and Computational Applications Journal Chiu et al. [1] and Chen and Chiu [2] propose an inventory model based on EPQ with rework to determine the replenishment lot size and the number of shipments for a vendor-buyer integrated production-inventory system. They solve the inventory problem by considering both variables as continuous. However, the number of shipments must be considered as discrete variable. In this direction, this paper revisits and solves the inventory problem of [1-2] considering the decision variables according to their nature. Two easy and improved algorithms are proposed which simplify and complement the research works of [1-2].
A solution of m×n rectangular fuzzy game with payoff as imprecise numbers instead of crisp real numbers namely interval and triangular fuzzy numbers is considered here. Solution of such fuzzy games with pure stra...
A solution of m×n rectangular fuzzy game with payoff as imprecise numbers instead of crisp real numbers namely interval and triangular fuzzy numbers is considered here. Solution of such fuzzy games with pure strategies and the algebraic method to solve 2×2 fuzzy game without saddle point by using mixed strategies is also discussed. Here the m×n payoff matrix is reduced to 2×2 payoff matrix by dominance method. In this paper, we discuss a saddle point solution from an uncertain payoff matrix. Moreover solution method for fuzzy games has also been developed. Numerical example is provided to illustrate the method.
Using score function in a matrix game is very rare. In the proposed paper we have considered a matrix game with pay-off as triangular intuitionistic fuzzy number and a new ranking order has been proposed using value j...
详细信息
Using score function in a matrix game is very rare. In the proposed paper we have considered a matrix game with pay-off as triangular intuitionistic fuzzy number and a new ranking order has been proposed using value judgement index, available definitions and operations. A new concept of score function has been developed to defuzzify the pay-off matrix and solution of the matrix game has been obtained. A numerical example has been given in support of the proposed method.
In this paper, a new concept of bifuzzy bi-matrix game is introduced where all elements of the payoff matrices are characterized by bifuzzy variables. The uncertainties of entries of payoff matrices (bifuzzy variables...
In this paper, a new concept of bifuzzy bi-matrix game is introduced where all elements of the payoff matrices are characterized by bifuzzy variables. The uncertainties of entries of payoff matrices (bifuzzy variables) are measured by bifuzzy measure known as Chance measure. Combining the bifuzzy set theory and bi-matrix game theory, the solution concept of bifuzzy bi-matrix game theory is introduced. The quadratic programming problem plays the major role to solve bifuzzy bi-matrix game. In order to show the applicability and feasibility of our proposed method, a real-life bi-matrix game problem is considered and solved.
暂无评论