arXiv 18 Oct 2026 · Mathematics — Optimization
arXiv:2610.25038 · PDF · Extracted main text
Nested logit is widely used in operational demand models, yet jointly estimating its utility coefficients and nest dissimilarity parameters requires nonconvex optimization. Standard estimation routines offer no certificate of global optimality, leaving a gap between globally optimizing decisions under nested-logit demand and reliably estimating that demand model. We develop, to our knowledge, the first globally convergent optimization framework with an explicit global-accuracy guarantee for joint nested-logit estimation. Our central complexity result confines all exponential dependence to the number of free nest dissimilarity parameters: computation is polynomial in the numbers of observations, alternatives, and utility coefficients. Consequently, under the stated compact-domain and relaxation-error conditions, fixing the number of nests yields an additive polynomial-time approximation scheme (PTAS). The framework exploits an exact exponential-cone formulation for fixed dissimilarities and a spatial branch-and-bound algorithm that searches only over the free dissimilarities. Valid likelihood bounds provide an anytime certificate and finite termination at any prescribed additive average-log-likelihood tolerance. Across eight benchmark datasets and 240 estimation instances, the method certifies every reported solution and exposes inferior local estimates despite normal solver termination. These results establish a computational foundation for globally certified nested-logit estimation.
appendix boundary found by appendix_command · 56% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | MOSEK ApS (2024) The MOSEK Modeling Cookbook | 0.928 | 5 | 4 | 80% |
| 2 | Train K (2009) Discrete Choice Methods with Simulation | 0.928 | 4 | 3 | 100% |
| 3 | Chen R, Jiang H (2020) b) Capacitated assortment and price optimization under the nested logit model | 0.928 | 4 | 3 | 100% |
| 4 | Chares B (2009) Conic representations of the exponential function | 0.843 | 4 | 4 | 75% |
| 5 | Horst R, Tuy H (1996) Global Optimization: Deterministic Approaches | 0.843 | 4 | 4 | 75% |
| 6 | Tawarmalani M, Sahinidis NV (2002) Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming | 0.843 | 4 | 4 | 75% |
| 7 | McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: Part i—convex underestimating problems | 0.843 | 5 | 4 | 60% |
| 8 | Daganzo CF, Kusnic M (1993) Two properties of the nested logit model | 0.843 | 3 | 3 | 100% |
| 9 | Daly A, Zachary S (1978) Improved multiple choice models | 0.843 | 3 | 3 | 100% |
| 10 | Davis JM, Gallego G, Topaloglu H (2014) Assortment optimization under variants of the nested logit model | 0.843 | 3 | 3 | 100% |
Showing the top 10 of 47 scored citations.