首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   48篇
  免费   15篇
  国内免费   2篇
  2020年   7篇
  2019年   2篇
  2018年   1篇
  2016年   2篇
  2015年   4篇
  2014年   2篇
  2013年   7篇
  2012年   3篇
  2011年   2篇
  2010年   4篇
  2009年   5篇
  2008年   2篇
  2007年   9篇
  2006年   5篇
  2005年   4篇
  2004年   3篇
  2003年   2篇
  2001年   1篇
排序方式: 共有65条查询结果,搜索用时 437 毫秒
41.
We consider the problem of designing a contract to maximize the supplier's profit in a one‐supplier–one‐buyer relationship for a short‐life‐cycle product. Demand for the finished product is stochastic and price‐sensitive, and only its probability distribution is known when the supply contract is written. When the supplier has complete information on the marginal cost of the buyer, we show that several simple contracts can induce the buyer to choose order quantity that attains the single firm profit maximizing solution, resulting in the maximum possible profit for the supplier. When the marginal cost of the buyer is private information, we show that it is no longer possible to achieve the single firm solution. In this case, the optimal order quantity is always smaller while the optimal sale price of the finished product is higher than the single firm solution. The supplier's profit is lowered while that of the buyer is improved. Moreover, a buyer who has a lower marginal cost will extract more profit from the supplier. Under the optimal contract, the supplier employs a cutoff level policy on the buyer's marginal cost to determine whether the buyer should be induced to sign the contract. We characterize the optimal cutoff level and show how it depends on the parameters of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 41–64, 2001  相似文献   
42.
We consider a dynamic pricing model in which the instantaneous rate of the demand arrival process is dependent on not only the current price charged by the concerned firm, but also the present state of the world. While reflecting the current economic condition, the state evolves in a Markovian fashion. This model represents the real‐life situation in which the sales season is relatively long compared to the fast pace at which the outside environment changes. We establish the value of being better informed on the state of the world. When reasonable monotonicity conditions are met, we show that better present economic conditions will lead to higher prices. Our computational study is partially calibrated with real data. It demonstrates that the benefit of heeding varying economic conditions is on par with the value of embracing randomness in the demand process. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 66:73–89,2019  相似文献   
43.
We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis.  相似文献   
44.
We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010  相似文献   
45.
This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
46.
本文研究了节点负载处理能力异质条件下的无标度网络交通动力学过程,提出了一种基于节点资源利用率的全局动态路由策略。该策略利用网络中节点资源利用率构建了一种全局代价函数,选择使该代价函数最小的路径来传输负载。实验结果表明该路由策略在略微增加平均路径长度的情况下成倍地提高了网络负载传输能力,与有效路由策略的比较进一步验证了该策略的有效性。  相似文献   
47.
随着"网络中心战"理念的提出,网络在未来战争中的作用日益突出。在现代战争信息激增的情况下,网络拥塞将成为"网络中心战"研究的课题。在研究目前网络拥塞控制的基础上,提出了一种网络拥塞、混沌控制的思想及具体实施技术,为网络拥塞控制的研究提供了一种思路。  相似文献   
48.
Consider a set of product variants that are differentiated by some secondary attributes such as flavor, color, or size. The retailer's problem is to jointly determine the set of variants to include in her product line (“assortment”), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for some important special cases, including the case of horizontally differentiated items, and propose a dominance relationship for the general case that simplifies the search for an optimal assortment. We also discuss structural properties of the optimal prices. Finally, motivated by our analytical results, we propose a heuristic solution procedure, which is shown to be quite effective through a numerical study. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
49.
We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
50.
In this paper, we present a continuous time optimal control model for studying a dynamic pricing and inventory control problem for a make‐to‐stock manufacturing system. We consider a multiproduct capacitated, dynamic setting. We introduce a demand‐based model where the demand is a linear function of the price, the inventory cost is linear, the production cost is an increasing strictly convex function of the production rate, and all coefficients are time‐dependent. A key part of the model is that no backorders are allowed. We introduce and study an algorithm that computes the optimal production and pricing policy as a function of the time on a finite time horizon, and discuss some insights. Our results illustrate the role of capacity and the effects of the dynamic nature of demand in the model. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号