Metraipolis › archive › dc_ee1de1b032b2
Constrained Nested-Logit Pricing: An Exact Reformulation and Global Optimization Method — arXiv:2611.09023
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09023
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:42:29.139Z
- SHA-256 of the archived text
d07a37e0b7ec06fda3703bbfc9ca5b9c05145a126f51e8cc79f9cda68c026b42- Stable URL of this page
https://metraipolis.com/documento/dc_ee1de1b032b2
How to cite
Constrained Nested-Logit Pricing: An Exact Reformulation and Global Optimization Method — arXiv:2611.09023 — arXiv (en), https://arxiv.org/abs/2611.09023 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee1de1b032b2 (Metraipolis archive dc_ee1de1b032b2, sha256 d07a37e0b7ec06fda3703bbfc9ca5b9c05145a126f51e8cc79f9cda68c026b42)
BibTeX
@misc{dcee1de1b032b2,
title = {Constrained Nested-Logit Pricing: An Exact Reformulation and Global Optimization Method — arXiv:2611.09023},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09023},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee1de1b032b2; sha256 d07a37e0b7ec06fda3703bbfc9ca5b9c05145a126f51e8cc79f9cda68c026b42},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09023. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Sellers must price substitutable products while meeting operational requirements such as price limits and sales targets. Nested logit captures stronger substitution among similar products, but these requirements can undermine the structure used to solve unconstrained pricing problems. We develop an exact reformulation and a global optimization method for a fixed assortment with price bounds and weighted price caps. The key novelty is to concentrate the difficult interactions at the nest level while retaining convex optimization over individual products, without discretizing prices or approximating demand. This structure makes the number of nests, rather than products, govern the exponent in a conditional worst-case complexity bound. The method returns feasible prices together with a bound on how much profit could still be gained, allowing decision makers to assess solution quality even when computation stops early. Extensions cover purchase-probability bounds and price-order rules, with explicit accounts of their computational cost. In synthetic experiments, the method certifies solutions for assortments of up to 500 products with few nests. Projecting unconstrained prices onto the feasible set loses up to 32.60% of profit relative to direct constrained optimization, highlighting the value of jointly optimizing substitution and feasibility. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC) ; Econometrics (econ.EM). Pagina del lavoro: https://arxiv.org/abs/2611.09023 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:35:32.245Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).