-
作者：Bertsimas, Dimitris; Brynjolfsson, Erik; Reichman, Shachar; Silberholz, John
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT); Tel Aviv University
摘要：Tenure decisions, key decisions in academic institutions, are primarily based on subjective assessments of candidates. Using a large-scale bibliometric database containing 198,310 papers published 1975-2012 in the field of operations research (OR), we propose prediction models of whether a scholar would perform well on a number of future success metrics using statistical models trained with data from the scholar's first five years of publication, a subset of the information available to tenure...
-
作者：Qi, Wei; Liang, Yong; Shen, Zuo-Jun Max
作者单位：Tsinghua University; Tsinghua University; University of California System; University of California Berkeley; University of California System; University of California Berkeley
摘要：Regions with abundant wind resources usually have no ready access to the existing electric grid. However, building transmission lines that instantaneously deliver all geographically distributed wind energy can be costly. Energy storage (ES) systems can help reduce the cost of bridging wind farms and grids and mitigate the intermittency of wind outputs. In this paper, we propose models of transmission network planning with colocation of ES systems. Our models determine the sizes and sites of ES...
-
作者：Levi, Retsef; Perakis, Georgia; Uichanco, Joline
作者单位：Massachusetts Institute of Technology (MIT); University of Michigan System; University of Michigan
摘要：Consider the newsvendor model, but under the assumption that the underlying demand distribution is not known as part of the input. Instead, the only information available is a random, independent sample drawn from the demand distribution. This paper analyzes the sample average approximation (SAA) approach for the data-driven newsvendor problem. We obtain a new analytical bound on the probability that the relative regret of the SAA solution exceeds a threshold. This bound is significantly tight...
-
作者：Liu, Yan; Cooper, William L.
作者单位：Shanghai University of Finance & Economics; University of Minnesota System; University of Minnesota Twin Cities
摘要：We consider an infinite-horizon single-product pricing problem in which a fraction of customers is patient and the remaining fraction is impatient. A patient customer will wait up to some fixed number of time periods for the price of the product to fall below his or her valuation at which point the customer will make a purchase. If the price does not fall below a patient customer's valuation at any time during those periods, then that customer will leave without buying. In contrast, impatient ...
-
作者：Jasin, Stefanus; Sinha, Amitabh
作者单位：University of Michigan System; University of Michigan
摘要：We consider an online multi-item retailer with multiple fulfillment facilities and finite inventory. The challenge faced by the retailer is to construct a fulfillment policy to decide from which facility each of the items in the arriving order should be fulfilled, in a way that minimizes the expected total shipping costs of fulfilling customer orders over a finite horizon. Shipping costs are linear in the size of the package shipped as well as the distance from the facility to the customer. We...
-
作者：Vossen, Thomas W. M.; Zhang, Dan
作者单位：University of Colorado System; University of Colorado Boulder
摘要：The linear programming approach to approximate dynamic programming has received considerable attention in the recent network revenue management literature. A major challenge of the approach lies in solving the resulting approximate linear programs (ALPs), which often have a huge number of constraints and/or variables. We show that the ALPs can be dramatically reduced in size for both affine and separable piecewise linear approximations to network revenue management problems, under both indepen...
-
作者：Yu, Yueshan; Chen, Xin; Zhang, Fuqiang
作者单位：Washington University (WUSTL); University of Illinois System; University of Illinois Urbana-Champaign
摘要：This paper studies a capacity management problem with upgrading. A firm needs to procure multiple classes of capacities and then allocate the capacities to satisfy multiple classes of customers that arrive over time. A general upgrading rule is considered, i. e., unmet demand can be satisfied using multistep upgrade. No replenishment is allowed and the firm has to make the allocation decisions without observing future demand. We first characterize the structure of the optimal allocation policy...
-
作者：Abbas, Ali E.; Bell, David E.
作者单位：University of Southern California; University of Southern California; Harvard University
摘要：We study the problem of finding ordinal utility functions to rank the outcomes of a decision when preference independence between the attributes is not present. We propose that the next level of complexity is to assume that preferences over one attribute can switch at most once as another attribute varies from low to high. We refer to this property as ordinal one-switch independence. We present both necessary and sufficient conditions for this ordinal property to hold and provide families of f...
-
作者：Bleichrodt, Han; Keskin, Umut; Rohde, Kirsten I. M.; Spinu, Vitalie; Wakker, Peter
作者单位：Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam; Istanbul Bilgi University
摘要：We introduce a new type of preference condition for intertemporal choice, which requires present values to be independent of various other variables. The new conditions are more concise and more transparent than traditional ones. They are directly related to applications because present values are widely used tools in intertemporal choice. Our conditions give more general behavioral axiomatizations, which facilitate normative debates and empirical tests of time inconsistencies and related phen...
-
作者：Kim, Kibaek; Mehrotra, Sanjay
作者单位：Northwestern University
摘要：We study the problem of integrated staffing and scheduling under demand uncertainty. This problem is formulated as a two-stage stochastic integer program with mixed-integer recourse. The here-and-now decision is to find initial staffing levels and schedules. The wait-and-see decision is to adjust these schedules at a time closer to the actual date of demand realization. We show that the mixed-integer rounding inequalities for the second-stage problem convexify the recourse function. As a resul...
