Abstract
In this paper, we address a pricing problem defined over a transportation network, and where the underlying flow is assigned according to the logit model. This setting yields a nonlinear optimization problem that yet possesses strong combinatorial features. Taking advantage of the model's analytical properties, we characterize its first-order optimality conditions and introduce rules that simplify the network topology, while leaving the structure of optimal solutions unchanged. Based on these results, a class of unimodal instances is identified. Finally, the connection with the more classical problem known as ‘product line pricing’ in economics is emphasized.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
