SearcharxivSearch

arXiv · 2608.23046

Dynamic Markdown Strategies for Perishable Products: Waste Reduction versus Profitability

Abstract

Freshness is a key attribute of perishable goods, particularly in the food sector, and strongly influences consumer purchasing behavior. Retailers often prioritize high freshness to remain competitive, yet maintaining this standard under demand uncertainty increases the likelihood of unsold inventory and waste. Retailers use markdowns to mitigate this risk, but the timing and depth of discounts must be carefully coordinated to avoid lost revenue or excess waste. This paper studies how retailers can jointly optimize order and markdown pricing decisions to balance profitability and waste reduction for perishable products within an integrated decision-making framework. The joint ordering-markdown pricing problem is formulated as a stochastic dynamic programming model that accounts for the demand cannibalization between regular price and markdown sales. The conflicting objectives of profit maximization and waste reduction are captured through a weighted objective function that reflects the retailer's trade-off preferences. To manage the complexity of the model, we propose an efficient solution approach and conduct numerical experiments to assess the performance of alternative markdown policies. Our results show that implementing multiple early price reductions with successive price reductions can simultaneously increase revenue and reduce waste. Our findings generate several key managerial insights: (i) firms can tailor their markdown policies according to their strategic priorities of profit maximization, waste reduction, or a balanced combination of both, (ii) early and well-timed markdowns based on available inventory levels allow firms to simultaneously attract quality-seeking customers and price-sensitive segments, (iii) implementing a second or multiple markdowns can further reduce waste while also increasing revenue.

Explore related subjects

Keep this discovery

BibTeXRIS

Nishika Bhatia, Nalan Gülpınar, Nurşen Aydın. 2026-08-24. Dynamic Markdown Strategies for Perishable Products: Waste Reduction versus Profitability. https://arxiv.org/abs/2608.23046

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC