The transportation problems are primarily concerned with the optimal way in which products produced at different plants (supply origins) are transported to a number of warehouses or customers (demand destinations). The objective in a transportation problem is to fully satisfy the destination requirements within the operating production capacity constraints at the minimum possible cost. The obje...

Abstract This paper examines a two-period dynamic contracting in supply chain under information asymmetry, where supplier sells product to retailer via trade credit contract. It is found that the always prefers conceal her actual cost thus signal as higher-cost type first period pursue higher rent, which would decrease supplier’s profit and thereby overall of chain. To mitigate this ratchet eff...

We develop and implement a model for a profit maximizing firm that provides an intermediation service between commodity producers and commodity end-users distributed over a realistic spatial network. Producers and end-users trade with the firm through contracts for delivery of grain during the marketing season. The firm begins the marketing season with a portfolio of prearranged purchase and sa...

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

cotton as a strategic product plays an important role inthe economy of boshrouyehwhere is known as the major cotton producing center of khorasan-e-jonoubi. in this paper, efficiency of boshroyeh cotton farms in 2007 have been calculated using data envelopment analysis (dea) and determinants of efficiency were identified using tobit regression analysis. the data was collected from questionnaires...

We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people, B is a set of items, and each person a ∈ A ranks a subset of items in an order of preference, with ties allowed. The popular matching problem seeks to compute a matching M∗ between people and items such that there is n...

In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning tree games, where the costs are assumed to be symmetric. The focus is on rules which satisfy axioms re...