Preservation of Structural Properties in Optimization with Decisions Truncated by Random Variables and Its Applications
- 1 April 2018
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 66 (2) , 340-357
Abstract
A common technical challenge encountered in many operations management models is that decision variables are truncated by some random variables and the decisions are made before the values of these random variables are realized, leading to nonconvex minimization problems. To address this challenge, we develop a powerful transformation technique that converts a nonconvex minimization problem to an equivalent convex minimization problem. We show that such a transformation enables us to prove the preservation of some desired structural properties, such as convexity, submodularity, and L♮-convexity, under optimization operations, that are critical for identifying the structures of optimal policies and developing efficient algorithms. We then demonstrate the applications of our approach to several important models in inventory control and revenue management: dual sourcing with random supply capacity, assemble-to-order systems with random supply capacity, and capacity allocation in network revenue management.Keywords
This publication has 41 references indexed in Scilit:
- A new approach to two-location joint inventory and transshipment control via -convexityOperations Research Letters, 2015
- The Logic of Logistics2014
- Sourcing from suppliers with random yield for price-dependent demandAnnals of Operations Research, 2012
- Re-solving stochastic programming models for airline revenue managementAnnals of Operations Research, 2009
- Recent Developments in Discrete Convex Analysis2008
- Airline network revenue management by multistage stochastic programmingComputational Management Science, 2007
- The Theory and Practice of Revenue Management2004
- Supply Chain Operations: Assemble-to-Order Systems2003
- Discrete convex analysisMathematical Programming, 1998
- A delivery‐lag inventory model with an emergency provision (the single‐period case)Naval Research Logistics Quarterly, 1961