Assortment optimization has received significant attention in recent revenue management and combinatorial optimization literature. In “The Approximability of Assortment Optimization Under Ranking Preferences,” A. Aouad, V. Farias, R. Levi, and D. Segev provide best-possible approximability bounds for this problem under an almost general model specification, where preferences are expressed as a distribution over rankings. This paper shows how this optimization problem relates to the computational task of detecting large independent sets in graphs, allowing the establishment of strong complexity lower bounds with respect to various problem parameters. These findings are complemented by a number of algorithms that attain essentially best-possible approximation factors, proving that the hardness results are tight up to lower-order terms. Surprisingly, their results imply that a simple and widely studied policy, known as revenue-ordered assortments, achieves the best possible performance guarantee with respect to prices.
Economically motivated adulteration (EMA) is a serious threat to public health. In this paper, we develop a modeling framework to examine farms’ strategic adulteration behavior and the resulting EMA risk in farming supply chains. We study both “preemptive EMA,” in which farms engage in adulteration to decrease the likelihood of producing low-quality output, and “reactive EMA,” in which adulteration is done to increase the perceived quality of the output. We fully characterize the farms’ equilibrium adulteration behavior in both types of EMA and analyze how quality uncertainty, supply chain dispersion, traceability, and testing sensitivity (in detecting adulteration) jointly impact the equilibrium adulteration behavior. We determine when greater supply chain dispersion leads to a higher EMA risk and how this result depends on traceability and testing sensitivity. Furthermore, we caution that investing in quality without also enhancing testing capabilities may inadvertently increase EMA risk. Our results highlight the limitations of only relying on end-product inspection to deter EMA. We leverage our analyses to offer tangible insights that can help companies and regulators to more proactively address EMA risk in food products. This paper was accepted by Charles Corbett, operations management.
Consider-then-choose models, borne out by empirical literature in marketing and psychology, explain that customers choose among alternatives in two phases, by first screening products to decide which alternatives to consider and then ranking them. In this paper, we develop a dynamic programming framework to study the computational aspects of assortment optimization under consider-then-choose premises. Although nonparametric choice models generally lead to computationally intractable assortment optimization problems, we are able to show that for many empirically vetted assumptions on how customers consider and choose, our resulting dynamic program is efficient. Our approach unifies and subsumes several specialized settings analyzed in previous literature. Empirically, we demonstrate the predictive power of our modeling approach on a combination of synthetic and real industry data sets, where prediction errors are significantly reduced against common parametric choice models. In synthetic experiments, our algorithms lead to practical computation schemes that outperform a state-of-the-art integer programming solver in terms of running time, in several parameter regimes of interest. This paper was accepted by Yinyu Ye, optimization.
Introduction: A paucity of literature exists regarding delays in transfer out of the intensive care unit. We sought to analyze the incidence, causes, and costs of delayed transfer from a surgical intensive care unit (SICU). Methods: An IRB-approved prospective observational study was conducted from January 24, 2010, to July 31, 2010, of all 731 patients transferred from a 20-bed SICU at a large tertiary-care academic medical center. Data were collected on patients who were medically ready for transfer to the floor who remained in the SICU for at least 1 extra day. Reasons for delay were examined, and extra costs associated were estimated. Results: Transfer to the floor was delayed in 22% (n = 160) of the 731 patients transferred from the SICU. Delays ranged from 1 to 6 days (mean, 1.5 days; median, 2 days). The extra costs associated with delays were estimated to be $581,790 during the study period, or $21,547 per week. The most common reasons for delay in transfer were lack of available surgical-floor bed (71% (114 of 160)), lack of room appropriate for infectious contact precautions (18% (28 of 160)), change of primary service (Surgery to Medicine) (7% (11 of 160)), and lack of available patient attendant ("sitter" for mildly delirious patients) (3% (five of 160)). A positive association was found between the daily hospital census and the daily number of SICU beds occupied by patients delayed in transfer (Spearman rho = 0.27; P < 0.0001). Conclusions: Delay in transfer from the SICU is common and costly. The most common reason for delay is insufficient availability of surgical-floor beds. Delay in transfer is associated with high hospital census. Further study of this problem is necessary.
1 May 2017 in Production and Operations Management