-
作者：Feng, YY; Xiao, BC
作者单位：National University of Singapore; Long Island University; Long Island University Post
摘要：It is a common practice for industries to price the same products at different levels. For example, airlines charge various fares for a common pool of seats. Seasonal products are sold at full or discount prices during different phases of the season. This article presents a model that reflects this yield management problem. The model assumes that (1) products are offered at multiple predetermined prices over time; (2) demand is price sensitive and obeys the Poisson process; and (3) price is al...
-
作者：Mehrabian, S; Jahanshahloo, GR; Alirezaee, MR; Amin, GR
作者单位：Islamic Azad University
摘要：This paper clarifies the role of non-Archimedean infinitesimal epsilon in DEA models so that the associated linear programs may be infeasible (for the multiplier side) and unbounded (for the envelopment side) for certain values of epsilon. It is shown that the bound of epsilon proposed by Ali and Seiford (1993) is invalid for feasibility and boundedness of the linear programs. A procedure is presented for determining an assurance interval of epsilon. It is also shown that an assurance value fo...
-
作者：Thonemann, UW; Brandeau, ML
作者单位：Stanford University
摘要：Increased competition and more demanding customers have forced companies to offer a wide variety of products. Component commonality can help companies reduce the cost of providing product variety to their customers. However, determining the extent to which component commonality should be used is difficult. In this paper we present an approach to determine the optimal level of component commonality for end-product components that do not differentiate models from the customer's perspective. The ...
-
作者：Wallace, SW
作者单位：Norwegian University of Science & Technology (NTNU)
摘要：Sensitivity analysis, combined with parametric optimization, is often presented as a way of checking if the solution of a deterministic linear program is reliable-even if some of the parameters are not fully known bur are instead replaced by a best guess, often a sample mean. It is customary to claim that if the region over which a certain basis is optimal is large, one is fairly safe by using the solution of the linear program. If not, the parametric analysis will provide us with alternative ...
-
作者：Chen, H; Zhang, HQ
作者单位：University of British Columbia; Chinese Academy of Sciences
摘要：In this paper, we establish a sufficient condition for the stability of a multiclass fluid network and queueing network under priority sen;ice disciplines. The sufficient condition is based on the existence of a linear Lyapunov function, and it is stated in terms of the feasibility of a set of linear inequalities that are defined by network parameters. In an the networks we have tested, this sufficient condition actually gives a necessary and sufficient condition for their stability.
-
作者：Boucherie, RJ; van Dijk, NM
作者单位：University of Amsterdam
摘要：This paper presents a queueing network description of a cellular mobile communications network. These cellular networks an characterised by the call lengths, the fresh call arrival rate, and the handover rates, as well as the capacity restrictions on the number of calls because of limited bandwidth. In the resulting queueing network the routing probabilities depend on the age of the customers. This queueing network is amenable to analysis via known methods. Tn particular, insensitivity results...
-
作者：Smith, SA; Agrawal, N
作者单位：Santa Clara University
摘要：Customers for retail merchandise can often be satisfied with one of several items. Accounting for demand substitution in defining customer service influences the choice of items to stock and the optimal inventory level fur each item stocked. Further, when certain items are not stocked, the resulting substitutions increase the demand for other items, which also affects the optimal stock levels. In this paper, we develop a probabilistic demand model for items in an assortment that captures the e...
-
作者：Sayin, S
作者单位：Koc University
摘要：The problem of optimizing a linear function over the efficient set of a multiple objective linear programming problem is studied. The decomposition of the efficient set into efficient faces is used as the basis of a search-based algorithm to solve this problem. The faces of the feasible region are characterized by the set of constraints that hold as equality in that face. The search is conducted over the indices of the constraints in a way that explores faces of possibly higher dimension first...
-
作者：Cheung, RKM; Powell, WB
作者单位：Hong Kong University of Science & Technology; Princeton University
摘要：We consider the problem of approximating the expected recourse function for two-stage stochastic programs. Our problem is motivated by applications that have special structure, such as an underlying network that allows reasonable approximations to the expected recourse function to be developed. In this paper, we show how these approximations can be improved by combining them with sample gradient information from the hue recourse function. For the case of strictly convex nonlinear approximation...
-
作者：Bertsimas, D; Niño-Mora, J
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Pompeu Fabra University
摘要：We develop a mathematical programming approach for the classical PSPACE-hard restless bandit problem in stochastic optimization. We introduce a hierarchy of N (where N is the number of bandits) increasingly stronger linear programming relaxations, the last of which is exact and corresponds to the (exponential size) formulation of the problem as a Markov decision chain, while the other relaxations provide bounds and are efficiently computed. We also propose a priority-index heuristic scheduling...
