This paper explores the study of multi-choice multi-objective transportation problem (MCMTP) under the environment of utility function approach. MCMTP is converted to multi-objective transportation problems (MOTP) by ...
This paper explores the study of multi-choice multi-objective transportation problem (MCMTP) under the environment of utility function approach. MCMTP is converted to multi-objective transportation problems (MOTP) by transforming the multi-choice parameters like cost, demand, and supply to real-valued parameters. A general transformation procedure using binary variables is illustrated to reduce MCMTP into MOTP. Most of the MOTP are solved by goal programming (GP) approach. Using GP, the solution of MOTP may not be satisfied all the time by the decision maker (DM) when the proposed problem contains interval-valued aspiration level. To overcome this difficulty, here we propose the approaches of revised multi-choice goal programming (RMCGP) and utility function into the MOTP and then compared the solution between them. Finally, numerical examples are presented to show the feasibility and usefulness of our paper.
Two important problems in infocommunication of scheduling batch processing are investigated having discrete-continuous character. A number of mathematical models of these problems were built including mixed discrete, ...
详细信息
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.
The present article deals with a backorder Economic Order Quantity (EOQ) model for natural leisure/closing time system where the demand rate depends upon the total shortage period and the seasonal effect. A cost minim...
详细信息
The numerical results of the polynomial solution of the optimization problem with a free phase are presented. The case of a complex polynomial of the first degree is considered. This polynomial shows good approximatio...
详细信息
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 article, the notion of pentagonal fuzzy number (PFN) is introduced in a generalized way. A few articles have been published based on this topic, but they have some ambiguities in defining this type of fuzzy nu...
详细信息
In this article, the notion of pentagonal fuzzy number (PFN) is introduced in a generalized way. A few articles have been published based on this topic, but they have some ambiguities in defining this type of fuzzy number. Here, we proposed the logical definition in developing a pentagonal fuzzy number, along with its arithmetic operations. Based on PFN, the structure of pentagonal fuzzy matrices (PFMs) is studied, together with their basic properties. Some special type of PFMs and their algebraic natures (trace of PFM, adjoint of PFM, determinant of PFM, etc.) are discussed in this article. Finally, the notion of nilpotent PFM, comparable PFM, and constant PFMs, with their many properties, are highlighted in this article.
In this paper, a competition of selling two substitutable products and one complementary product has been studied in two-echelon supply chain systems in which one of these three products is produced by one manufacture...
详细信息
In this paper, a competition of selling two substitutable products and one complementary product has been studied in two-echelon supply chain systems in which one of these three products is produced by one manufacturer separately, and all produced items are sold through a common retailer in the market. The demand of each product depends linearly on prices of these three products as per their nature. In this study, four different decision scenarios are developed mathematically under the game theory framework to maximize the profit function of each participant of the supply chain, and a number of pricing strategies are subsequently worked out for manufacturers and retailer. Finally, the model under different scenarios is illustrated with numerical data to study the feasibility of the model exploring the managerial insights, as well. Different marketing policies are predicted for maximum individual and system profits.
In the present work, we developed a mathematical model for dengue-Chikungunya co-infection to analyze the disease transmission dynamics and interrelationship. We considered the essence of time dependent optimal contro...
详细信息
The aim of this paper is to introduce the concept of generalised multi-fuzzy soft set. We also define several generalised multi-fuzzy soft set operations and study their properties, and applications of generalised mul...
详细信息
The aim of this paper is to introduce the concept of generalised multi-fuzzy soft set. We also define several generalised multi-fuzzy soft set operations and study their properties, and applications of generalised multi-fuzzy soft sets in decision making problem were presented.
暂无评论