Piecewise linear lower and upper bounds for the standard normal first order loss function


Creative Commons License

Rossi R., TARIM Ş. A., Prestwich S., HNİCH B.

APPLIED MATHEMATICS AND COMPUTATION, cilt.231, ss.489-502, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 231
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1016/j.amc.2014.01.019
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.489-502
  • Hacettepe Üniversitesi Adresli: Evet

Özet

The first order loss function and its complementary function are extensively used in practical settings. When the random variable of interest is normally distributed, the first order loss function can be easily expressed in terms of the standard normal cumulative distribution and probability density function. However, the standard normal cumulative distribution does not admit a closed form solution and cannot be easily linearised. Several works in the literature discuss approximations for either the standard normal cumulative distribution or the first order loss function and their inverse. However, a comprehensive study on piecewise linear upper and lower bounds for the first order loss function is still missing. In this work, we initially summarise a number of distribution independent results for the first order loss function and its complementary function. We then extend this discussion by focusing first on random variables featuring a symmetric distribution, and then on normally distributed random variables. For the latter, we develop effective piecewise linear upper and lower bounds that can be immediately embedded in MILP models. These linearisations rely on constant parameters that are independent of the mean and standard deviation of the normal distribution of interest. We finally discuss how to compute optimal linearisation parameters that minimise the maximum approximation error. (C) 2014 Elsevier Inc. All rights reserved.