Forthcoming in Mathematics of Operations Research. A CHARACTERIZATION OF COMBINATORIAL DEMAND
نویسندگان
چکیده
We prove that combinatorial demand functions are characterized by two properties: continuity and the law of demand.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملA multi-parametric approach for solid transportation problem with uncertainty fuzzy flexible conditions
The most convenient models of Solid Transportation (ST) problems have been justly considered a kind of uncertainty in their parameters such as fuzzy, grey, stochastic, etc. and usually, they suggest solving the main problems by solving some crisp equivalent model/models based on their proposed approach such as using ranking functions, embedding problems etc. Furthermore, there exist some shortc...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کاملA Quadratic Bound on the Diameter of the Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m× n transportation problem is less than 12 (m + n). The transportation problem ( TP ) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [8] and independently by Koopmans in 1947 [11], and appears in any standard introductory course on op...
متن کامل