New Formulations for Choice Network Revenue Management

摘要: Models incorporating more realistic models of customer behavior, as customers choosing from an offer set, have recently become popular in assortment optimization and revenue management. The dynamic program for these is intractable approximated by a deterministic linear called the choice (CDLP), which has exponential number columns. Column generation been proposed but finding entering column NP-hard when segment consideration sets overlap. In this paper we propose new approach segment-based concave (SDCP) based on segments their sets. SDCP relaxation CDLP hence forms looser upper bound program, coincides with case nonoverlapping segments. If elements set not very large, can be applied to any discrete-choice model consumer behavior. We tighten (i) simulations, ra...