Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.07482 v5 pith:LH3LKGB5 submitted 2020-05-15 math.OC

An exact algorithm for the static pricing problem under discrete mixed logit demand

classification math.OC
keywords problemoptimizationpricingalgorithmdiscretelogitmixedapproximate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Price differentiation is a common strategy in many markets. In this paper, we study a static multiproduct price optimization problem with demand given by a discrete mixed multinomial logit model. By considering a mixed logit model that includes individual-specific variables in the utility specification, our pricing problem reflects well the discrete choice models used in practice. To solve this pricing problem, we design an efficient iterative optimization algorithm that asymptotically converges to the optimal solution. To this end, a linear optimization (LO) problem is formulated, based on the trust-region approach, to find a "good" feasible solution and approximate the problem from below. Another LO problem is designed using piecewise linear relaxations to approximate the optimization problem from above. Then, we develop a new branching method to tighten the optimality gap. The effectiveness of our algorithm is demonstrated on a parking services pricing case, and a benchmark against solvers and existing contributions in the literature are performed.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.