| dc.description.abstract | A common topic of study in the subfield of Operations Research known as Revenue Management
is finding optimal prices for a line of products given customer preferences. While there exists a
large number of ways to model optimal pricing problems, in this thesis we study a price-based
Revenue Management model known as the Maximum Utility Problem (MUP). In this model, we
are given a set of n customer segments and m products, as well as reservation prices Rij which
reflect the amount that Segment i is willing to pay for Product j. Using a number of structural and
behavioral assumptions, if we derive a vector of prices for our line of products, we can compute an
assignment of customers to products. We wish to find the set of prices that leads to the optimal
amount of revenue given our rules for assigning customers to products. Using this framework, we
can formulate a Nonlinear Mixed Integer Programming formulation that, while difficult to solve,
has a surprising amount of underlying structure. If we fix an assignment and simply ask for the
optimal set of prices such that said assignment is feasible, we obtain a new linear program, the
dual of which happens to be a set of shortest-paths problems. This fact lead to the development of
the Dobson-Kalish Algorithm, which explores a large number of assignments and quickly computes
their optimal prices.
Since the introduction of the Dobson-Kalish Algorithm, there has been a rich variety of literature
surrounding MUP and its relatives. These include the introduction of utility tolerances to increase
the robustness of the model, as well as new approximation algorithms, hardness results, and insights
into the underlying combinatorial structure of the problem. After detailing this history, this thesis
discusses a range of settings under which MUP can be solved in polynomial time. Relating it to
other equilibria and price-based optimization problems, we overview Stackelberg Network Pricing
Games as well as the general formulations of Bilevel Mixed Integer Linear Programs and Bilinear
Mixed Integer Programs, showing that our formulation of the latter is in fact a more general version
of the former. We provide some new structured instances for which we can prove additional ap-
proximation and runtime results for existing algorithms. We also contribute a generalized heuristic
algorithm and show that MUP can be solved exactly when the matrix of reservation prices is rank
1. Finally, we discuss techniques for improving the upper bound to the overall problem, analyzing
the primal and dual of the linear programming relaxation of MUP. To test the effectiveness of our
approach, we analyze numerous examples that have been solved using Gurobi and present possible
avenues for improving our ideas. | en |
