竞争环境下截流问题的选址-价格模型

研究了竞争环境下考虑产品定价的截流设施选址问题。连锁企业在市场上新建设施时,市场上已有属于竞争对手的设施存在,在连锁企业新建设施位置确定之后,两个企业关于产品定价进行双寡头完全信息非合作博弈。定义了效用函数,引入Huff模型,以企业利润最大为目标,建立双层规划模型,证明了模型纳什均衡价格的存在性,并构造启发式算法对模型进行求解。算例分析表明,该算法求解结果较为理想,可用于大中型网络的规划选址问题。     

Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly

This paper analyzes the impact of dynamic and fixed-ratio pricing policies on firm profits and equilibrium prices under competition. Firms that have equal inventories of perfectly substitutable and perishable products compete for customer segments that demand the product at different times. In each period, customers first purchase from the low price firm and then from the high price firm up to their inventories, provided the prices are lower than the maximum they are willing to pay. The main conclusions of this paper are as follows: although dynamic pricing is a more sophisticated policy than fixed-ratio pricing, it may lead to decreased equilibrium profits; under both pricing policies, one firm assumes the role of a low-cost high-output firm while the other assumes the role of a high-cost low-output firm; and, the supply demand ratio has more impact on the outcome of the competition than the heterogeneity in consumer reservation prices.     

Simple plant location under uniform delivered pricing

Given a geographical system of demand functions, the simple-plant location problem under uniform delivered pricing consists in determining the delivered price taken as uniform for all customers, the number, the locations, the sizes and the market areas of the plants which supply these customers, in order to maximize the profit of the firm. A model is proposed, which allows, moreover, to integrate some aspects of the commercial policy of the firm, i.e., its decision to satisfy all markets with positive demands or profitable markets only, or to allow a maximum unit loss or require a minimum unit gain on each served market. An efficient algorithm is presented and illustrated by an example. Computational results with a code using recursively Erlenkotter's DUALOC program as a subroutine are summarized.     

不同价格水平下排队策略研究

在M/M/1排队中引入了不同的服务价格,基于"收益-成本"结构,以顾客和企业均追求利益最大化为出发点,在两种不可见情形下,研究了顾客均衡策略行为和企业最优服务定价决策,通过数值模拟,描述了休假期服务价格对顾客均衡策略的影响,以及几乎不可见情况下休假期服务价格对企业收益的作用和完全不可见情况下休假期服务价格随潜在到达率的变化情况,以及当企业获得最大收益时,正常工作期和休假期服务价格的关系.     

On price competition in location-price models with spatially separated markets

In this paper we study price competition for two types of location-price models in which facility locations are set up and price decisions have to be made in order to maximise profit. We discuss the existence and determination of equilibrium prices in a general location space when facilities have different production costs. It is assumed that each price is bounded from below and demand for a single homogeneous product is price-inelastic. When facilities set mill prices, a price equilibrium rarely exists and necessary conditions for existence are obtained. In particular, when the location space is a tree network, we give a characterisation of the locations for which a unique equilibrium exists for two competitors. With spatial price discrimination, though equilibrium prices might not exist, it is shown that ε-equilibrium prices always exist for any locations of the facilities. A characterisation of ε-equilibrium is also given. Then the location-price problem is reduced to a location problem. A comparison of results with the two types of price determination is also presented. This work has been supported by the Ministry of Science and Technology of Spain under the research project BEC2002-01026, in part financed by the European Regional Development Fund (ERDF).     

Mystery of point charges

We discuss the problem of finding an upper bound for the numberof equilibrium points of a potential of several fixed pointcharges in ⁿ. This question goes back to J. C. Maxwell and M.Morse. Using fewnomial theory we show that for a given numberof charges there exists an upper bound independent of the dimension,and show it to be at most 12 for three charges. We conjecturean exact upper bound for a given configuration of non-negativecharges in terms of its Voronoi diagram, and prove it asymptotically.     

On a Profit Maximizing Location Model

In this paper we discuss a locational model with a profit-maximizing objective. The model can be illustrated by the following situation. There is a set of potential customers in a given region. A firm enters the market and wants to sell a certain product to this set of customers. The location and demand of each potential customer are assumed to be known. In order to maximize its total profit, the firm has to decide: (1) where to locate its distribution warehouse to serve the customers; (2) the price for its product. Due to existence of competition, each customer holds a reservation price for the product. This reservation price is a decreasing function in the distance to the warehouse. If the actual price is higher than the reservation price, then the customer will turn to some other supplier and hence is lost from the firm's market. The problem of the firm is to find the best location for its warehouse and the best price for its product at the same time in order to maximize the total profit. We show that under certain assumptions on the complexity counts, a special case of this problem can be solved in polynomial time.     

Optimal pricing and inventory policies with reliable and random-yield suppliers: characterization and comparison

In this paper, we study the joint pricing and inventory replenishment problem for a periodic-review inventory system with random demand and dual suppliers, one of the suppliers is reliable but more expensive, the other supplier is less expensive but is unreliable with random yield. We characterize the firm’s optimal policies that simultaneously determine the optimal ordering and pricing decisions in each period over a finite planning horizon, and investigate the impacts of supply source diversification and supplier reliability on the firm and on its customers. We show that having source diversification or higher reliability of suppliers not only increases the firm’s expected profit, but also results in a lower optimal selling price, thus they benefit both the firm and its customers.     

Optimizing pricing and location decisions for competitive service facilities charging uniform price

In this paper, we present the problem of optimizing the location and pricing for a set of new service facilities entering a competitive marketplace. We assume that the new facilities must charge the same (uniform) price and the objective is to optimize the overall profit for the new facilities. Demand for service is assumed to be concentrated at discrete demand points (customer markets); customers in each market patronize the facility providing the highest utility. Customer demand function is assumed to be elastic; the demand is affected by the price, facility attractiveness, and the travel cost for the highest-utility facility. We provide both structural and algorithmic results, as well as some managerial insights for this problem. We show that the optimal price can be selected from a certain finite set of values that can be computed in advance; this fact is used to develop an efficient mathematical programming formulation for our model.     

Hedging entry and exit decisions: optimizing location under exchange rate uncertainty

^** Email: alexru00{at}ms41.hinet.net^*** Email: ctlin{at}mail.yust.edu.tw The Cobb–Douglas production function with Abel's (1983,Am. Econ. Rev., 173, 228–233) model is extended herein,and real options analysis (ROA) for entry–exit decision-makingestablished utilizing Dixit's (1989b) decision model under exchangerate uncertainty. This work considers the effects of real exchangerates on strategies that determine the locations of productionby firms that are entering markets in two countries. The ROAis also adopted to evaluate the switching location between twocountries. A continuous-time model optimization problem is solvedin closed-form. This provides a useful beginning to an importantanalysis of the effects on industry of exchange rate fluctuationswhen the optimal entry (exit) trigger for transferring locationsis important for a basic global logistics model. Furthermore,a myopic solution of the optimal entry (exit) trigger, sensitivityanalysis and some characteristics of the optimal productionstrategy are sought. This paper contributes to the problem ofchoice of foreign production strategy.     

Solving the continuous space p-centre problem: planning application issues

^** Email: wei.97{at}osu.edu^*** Email: murray.308{at}osu.edu^**** Email: xiao.37{at}osu.edu The Voronoi diagram heuristic has been proposed for solvingthe p-centre problem in continuous space. However, importantassumptions underlie this heuristic and may be problematic forpractical applications. These simplifying assumptions includeuniformly distributed demand, representing a region as a rectangle;analysis of a simple Voronoi polygon in solving associated one-centreproblems and no restrictions on potential facility locations.In this paper, we explore the complexity of solving the continuousspace p-centre problem in location planning. Considering theissue of solution space feasibility, we present a spatiallyrestricted version of this problem and propose methods for solvingit heuristically. Theoretical and empirical results are provided.     

Interpolating Blaschke Products and Factorization Theorems

Let M(H) be the maximal ideal space of H the Banach algebraof bounded analytic functions on the open unit disk. Let G bethe set of nontrivial points in M(H). By Hoffman's work, G hasdeep connections with the zero sets of interpolating Blaschkeproducts. It is proved that for a closed -separated subset Eof M(H) with E G, there exists an interpolating Blaschke productwhose zero set contains E. This is a generalization of Lingenberg'stheorem. Let f be a continuous function on M(H). Suppose thatf is analytic on a nontrivial Gleason part P(x), f(x) = 0, andf 0 on P(x). It is proved that there is an interpolating Blaschkeproduct b with zeros {z_n}_n such that b(x) = 0 and f(z_n) = 0for every n. This fact can be used for factorization theoremsin Douglas algebras and in algebras of functions analytic onGleason parts.     

Sub-Laplacians of Holomorphic Lp-Type on Exponential Solvable Groups

Let L denote a right-invariant sub-Laplacian on an exponential,hence solvable Lie group G, endowed with a left-invariant Haarmeasure. Depending on the structure of G, and possibly alsothat of L, L may admit differentiable L^p-functional calculi,or may be of holomorphic L^p-type for a given p 2. ‘HolomorphicL^p-type’ means that every L^p-spectral multiplier for Lis necessarily holomorphic in a complex neighbourhood of somenon-isolated point of the L²-spectrum of L. This can in factonly arise if the group algebra L¹(G) is non-symmetric. Assume that p 2. For a point in the dual g^* of the Lie algebrag of G, denote by ()=Ad^*(G) the corresponding coadjoint orbit.It is proved that every sub-Laplacian on G is of holomorphicL^p-type, provided that there exists a point g^* satisfying Boidol'scondition (which is equivalent to the non-symmetry of L¹(G)),such that the restriction of () to the nilradical of g is closed.This work improves on results in previous work by Christ andMüller and Ludwig and Müller in twofold ways: on theone hand, no restriction is imposed on the structure of theexponential group G, and on the other hand, for the case p>1,the conditions need to hold for a single coadjoint orbit only,and not for an open set of orbits. It seems likely that the condition that the restriction of ()to the nilradical of g is closed could be replaced by the weakercondition that the orbit () itself is closed. This would thenprove one implication of a conjecture by Ludwig and Müller,according to which there exists a sub-Laplacian of holomorphicL¹ (or, more generally, L^p) type on G if and only if there existsa point g^* whose orbit is closed and which satisfies Boidol'scondition.     

Tangential Boundary Behaviour of Harmonic and Holomorphic Functions

Let K be a kernel on Rⁿ, that is, K is a non-negative, unboundedL¹ function that is radially symmetric and decreasing. We definethe convolution K * F by and note from L^p-capacity theory [11, Theorem 3] that, if F L^p, p > 1, then K * F exists as a finite Lebesgue integraloutside a set A Rⁿ with C_K,p(A) = 0. For a Borel set A, where We define the Poisson kernel for = {(x, y) : x Rⁿ, y > 0} by and set Thus u is the Poisson integral of the potential f = K * F, andwe write u=P_y*(K*F)=P_y*f=P[f]. We are concerned here with the limiting behaviour of such harmonicfunctions at boundary points of , and in particular with the tangential boundary behaviour ofthese functions, outside exceptional sets of capacity zero orHausdorff content zero.     

Differentiable Peak-Interpolation on Bounded Domains with Smooth Boundary

Let D be a bounded domain in Cⁿ with C² boundary, and, for 1 k , let A^k(D) be the algebra of functions holomorphic on Dand C^k on a neighbourhood of . It is shown that each peak-interpolation set for A^k(D) is afinite set.     

Ramsey and Freeness Properties of Polish Planes

Suppose that X is a Polish space which is not -compact. We provethat for every Borel colouring of X² by countably many colours,there exists a monochromatic rectangle with both sides closedand not -compact. Moreover, every Borel colouring of [X]² byfinitely many colours has a homogeneous set which is closedand not -compact. We also show that every Borel measurable functionf:X² X has a free set which is closed and not -compact. Ascorollaries of the proofs we obtain two results: firstly, theproduct forcing of two copies of superperfect tree forcing doesnot add a Cohen real, and, secondly, it is consistent with ZFCto have a closed subset of the Baire space which is not -compactand has the property that, for any three of its elements, noneof them is constructible from the other two. A similar proofshows that it is consistent to have a Laver tree such that noneof its branches is constructible from any other branch. Thelast four results answer questions of Goldstern and Brendle.2000 Mathematics Subject Classification: 03E15, 26B99, 54H05.     

On Finite and InfiniteCk-A-Determinacy

Let f: (Rⁿ,0) (R^p,0) be a C map-germ. We define f to be finitely,or -, A-determined, if there exists an integer m such that allgerms g with j^mg(0) = j^mf(0), or if all germs g with the sameinfinite Taylor series as f, respectively, are A-equivalentto f. For any integer k, 0 k < , we can consider A' sC^kcounterpart (consisting of C^k diffeomorphisms) A^(k), and wecan define the notion of finite, or -,A^(k)-determinacy in asimilar manner. Consider the following conditions for a C germf: (a_k) f is -A^(k)-determined, (b_k) f is finitely A^(k)-determined,(t) , (g) there exists a representative f : U R^p defined on some neighbourhood U of 0 in Rⁿ such thatthe multigerm of f is stable at every finite set , and (g') every f' with j f'(0)=j f(0) satisfiescondition (g). We also define a technical condition which willimply condition (g) above. This condition is a collection ofp+1 Lojasiewicz inequalities which express that the multigermof f is stable at any finite set of points outside 0 and onlybecomes unstable at a finite rate when we approach 0. We willdenote this condition by (e). With this notation we prove thefollowing. For any C map germ f:(Rⁿ,0) (R^p,0) the conditions(e), (t), (g') and (a) are equivalent conditions. Moreover,each of these conditions is equivalent to any of (a_k) (p+1 k < , (b_k) (p+1 k < ). 1991 Mathematics Subject Classification:58C27.     

Boundary Accessibility of a Domain Quasiconformally Equivalent to a Ball

A boundary point of a domain D in Rⁿ is said to be broadly accessibleif it ‘almost lies’ on the boundary of a round ballcontained in D. If f is a quasiconformal mapping of the unitball Bⁿ onto D, then it is shown that broadly accessible boundarypoints on D correspond under f to a set of full measure on Bⁿ.2000 Mathematics Subject Classification 30C65.     

A Ramsey-Type Result for Convex Sets

Given a family of n convex compact sets in the plane, one canalways choose n of them which are either pairwise disjoint orpairwise intersecting. On the other hand, there exists a familyof n segments in the plane such that the maximum size of a subfamilywith pairwise disjoint or pairwise intersecting elements inn^log2/log5 n^0·431.