Joline Uichanco

Joline Uichanco

Auto-generated profile, based on publicly available information

Joline Uichanco

Tandon School of Engineering, New York University, New York, New York 11201

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2018 in Management Science
Verified
Journal Article
Closed access
KNKarthik Natarajan
Karthik Natarajan
MSMelvyn Sim
Melvyn Sim
JUJoline Uichanco
Joline Uichanco
A basic assumption of the classical newsvendor model is that the probability distribution of the random demand is known. But in most realistic settings, only partial distribution information is available or reliably estimated. The distributionally robust newsvendor model is often used in this case where the worst-case expected profit is maximized over the set of distributions satisfying the known information, which is usually the mean and covariance of demands. However, covariance does not capture information on asymmetry of the demand distribution. In this paper, we introduce a measure of distribution asymmetry using second-order partitioned statistics. Semivariance is a special case with a single partition of the univariate demand. With mean, variance, and semivariance information, we show that a three-point distribution achieves the worst-case expected profit and derive a closed-form expression for the distributionally robust order quantity. For multivariate demand, the distributionally robust problem with partitioned statistics is hard to solve, but we develop a computationally tractable lower bound through the solution of a semidefinite program. We demonstrate in numerical experiments that asymmetry information significantly reduces expected profit loss particularly when the true distribution is heavy tailed. In computational experiments on automotive spare parts demand data, we provide evidence that the distributionally robust model that includes partitioned statistics outperforms the model that uses only covariance information. The electronic companion is available at https://doi.org/10.1287/mnsc.2017.2773 . This paper was accepted by Yinyu Ye, optimization.

1 January 2019 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
PHPavithra Harsha
Pavithra Harsha
SSShivaram Subramanian
Shivaram Subramanian
JUJoline Uichanco
Joline Uichanco
Omnichannel retail refers to a seamless integration of an e-commerce channel and a network of brick-and-mortar stores. An example is cross-channel fulfillment, which allows a store to fulfill online orders in any location. Another is price transparency, which allows customers to compare the online price with store prices. This paper studies a new and widespread problem resulting from omnichannel retail: price optimization in the presence of cross-channel interactions in demand and supply, where cross-channel fulfillment is exogenous. We propose two pricing policies that are based on the idea of “partitions” to the store inventory that approximate how this shared resource will be utilized. These policies are practical because they rely on solving computationally tractable mixed integer programs that can accept various business and pricing rules. In extensive simulation experiments, they achieve a small optimality gap relative to theoretical upper bounds on the optimal expected profit. The good observed performance of our pricing policies results from managing substitutive channel demands in accordance with partitions that rebalance inventory in the network. A proprietary implementation of the analytics is commercially available as part of the IBM Commerce markdown price solution. The system results in an estimated 13.7% increase in clearance-period revenue based on causal model analysis of the data from a pilot implementation for clearance pricing at a large U.S. retailer. The e-companion is available at https://doi.org/10.1287/msom.2018.0737 .

1 April 2021 in Management Science
Verified
Journal Article
Closed access
AGAravind Govindarajan
Aravind Govindarajan
ASAmitabh Sinha
Amitabh Sinha
JUJoline Uichanco
Joline Uichanco
We study a multilocation newsvendor network when the only information available on the joint distribution of demands are the values of its mean vector and covariance matrix. We adopt a distributionally robust model to find inventory levels that minimize the worst-case expected cost among the distributions consistent with this information. This problem is NP-hard. We find a closed-form tight bound on the expected cost when there are only two locations. This bound is tight under a family of joint demand distributions with six support points. For the general case, we develop a computationally tractable upper bound on the worst-case expected cost if the costs of fulfilling demands have a nested structure. This upper bound is the optimal value of a semidefinite program whose dimensions are polynomial in the number of locations. We propose an algorithm that can approximate general fulfillment cost structures by nested structures, yielding a computationally tractable heuristic for distributionally robust inventory optimization on general newsvendor networks. We conduct experiments on networks resembling U.S. e-commerce distribution networks to show the value of a distributionally robust approach over a stochastic approach that assumes an incorrect demand distribution. This paper was accepted by Chung Piaw Teo, optimization.

1 July 2022 in Operations Research
Verified
Journal Article
Closed access
MLMeichun Lin
Meichun Lin
WHWoonghee Tim Huh
Woonghee Tim Huh
HKHarish Krishnan
Harish Krishnan
JUJoline Uichanco
Joline Uichanco
Sample Average Approximation in Data-Driven Newsvendor In the data-driven newsvendor problem, the manager makes sequential inventory decisions while learning the unknown demand distribution based on past demand samples. How does the widely used sample average approximation approach perform in this problem? In “Technical Note—Data-Driven Newsvendor Problem: Performance of the Sample Average Approximation,” Lin, Huh, Krishnan, and Uichanco analyze the performance of the sample average approximation as the time horizon grows, which turns out to be the best possible. The authors also examine how the local flatness of the demand distribution around the optimal order quantity affects the complexity of the problem. They show that the sample average approximation has the best achievable performance in terms of not only the time horizon, but also the local flatness of the demand distribution.

1 May 2022 in Manufacturing & Service Operations Management
Verified
Journal Article
Closed access
YLYanzhe (Murray) Lei
Yanzhe (Murray) Lei
SJStefanus Jasin
Stefanus Jasin
JUJoline Uichanco
Joline Uichanco
AVAndrew Vakhutinsky
Andrew Vakhutinsky
Problem definition: We study a joint product framing and order fulfillment problem with both inventory and cardinality constraints faced by an e-commerce retailer. There is a finite selling horizon and no replenishment opportunity. In each period, the retailer needs to decide how to “frame” (i.e., display, rank, price) each product on his or her website as well as how to fulfill a new demand. Academic/practical relevance: E-commerce retail is known to suffer from thin profit margins. Using the data from a major U.S. retailer, we show that jointly planning product framing and order fulfillment can have a significant impact on online retailers’ profitability. This is a technically challenging problem as it involves both inventory and cardinality constraints. In this paper, we make progress toward resolving this challenge. Methodology: We use techniques such as randomized algorithms and graph-based algorithms to provide a tractable solution heuristic that we analyze through asymptotic analysis. Results: Our proposed randomized heuristic policy is based on the solution of a deterministic approximation to the stochastic control problem. The key challenge is in constructing a randomization scheme that is easy to implement and that guarantees the resulting policy is asymptotically optimal. We propose a novel two-step randomization scheme based on the idea of matrix decomposition and a rescaling argument. Managerial implications: Our numerical tests show that the proposed policy is very close to optimal, can be applied to large-scale problems in practice, and highlights the value of jointly optimizing product framing and order fulfillment decisions. When inventory across the network is imbalanced, the widespread practice of planning product framing without considering its impact on fulfillment can result in high shipping costs, regardless of the fulfillment policy used. Our proposed policy significantly reduces shipping costs by using product framing to manage demand so that it occurs close to the location of the inventory.

1 March 2022 in Operations Research
Verified
Journal Article
Closed access
MZMengzhenyu Zhang
Mengzhenyu Zhang
HAHyun-Soo Ahn
Hyun-Soo Ahn
JUJoline Uichanco
Joline Uichanco
Pricing a New Product with Data Before a product launch (or even after a launch), firms often have little demand information and often do not know critical information such as the market size, the willingness-to-pay distribution, or the adoption speed. The lack of information makes pricing a new product challenging, and insufficient data makes demand forecasting very difficult. This is particularly costly for new products because the current price not only affects the current revenue, but also the number of adopters who can influence future demand. In this paper, we consider a setting in which a firm can learn by observing early sales data at (different) prices over time. We propose a simple and computationally tractable pricing policy that guides price changes after introducing the product. Using mathematical proofs and computational study, we show that our method substantially outperforms existing methods even with a very few price changes during a selling season.