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.
Fuzzy competition graph as the generalization of competition graph is introduced here. A generalization of fuzzy competition graph known as fuzzy k-competition graph is also defined. These graphs are related to fuzzy ...
详细信息
Fuzzy competition graph as the generalization of competition graph is introduced here. A generalization of fuzzy competition graph known as fuzzy k-competition graph is also defined. These graphs are related to fuzzy digraphs. Fuzzy neighbourhood graphs, which are related to fuzzy graphs are defined here. Some relations between fuzzy competition graphs and fuzzy neighbourhood graphs have been established. Also several results to find strong edges of the stated graphs are obtained.
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].
Source code generation is an essential part of wide range of applications, including transcompilers, parser generators and preprocessors. The common technology based on code templates is often cumbersome and error-pro...
详细信息
ISBN:
(纸本)9781450311915
Source code generation is an essential part of wide range of applications, including transcompilers, parser generators and preprocessors. The common technology based on code templates is often cumbersome and error-prone. This paper introduces syngen1, an automatic tool, written in Scheme, designed to produce frameworks for building syntactically correct fragments of source code. Copyright 2012 ACM.
In this paper, we define some results on generalized interval-valued intuitionistic fuzzy sets (GIVIFSs). In fact, all interval-valued intuitionistic fuzzy sets (IVIFSs) are GIVIFSs but all GIVIFSs are not IVIFSs. We ...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
When some suppliers offer trade credit periods and price discounts to retailers in order to increase the demand of their products, retailers have to face different types of discount offers and credits within which the...
When some suppliers offer trade credit periods and price discounts to retailers in order to increase the demand of their products, retailers have to face different types of discount offers and credits within which they have to take a decision which is the best offer for them to make more profit. The retailers try to buy perfect-quality items at a reasonable price, and also they try to invest returns obtained by selling those items in such a manner that their business is not hampered. In this point of view, we consider an economic order quantity (EOQ) model for various types of time-dependent demand when delay in payment and price discount are permitted by suppliers to retailers. The models of various demand patterns are discussed analytically. Some numerical examples and graphical representations are considered to illustrate the model.
This paper presents a one machine multiple-product problem with bounded production rate to minimize the total linear cost of inventory under imprecise space constraint. The demand is dependent on time and known. Also ...
详细信息
暂无评论