Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. EPFL thesis
  4. Robust Optimization for Product Line Design
 
doctoral thesis

Robust Optimization for Product Line Design

Han, Jun  
2025

In order to extract maximum surplus from a heterogeneous customer base it is common practice for firms to offer a portfolio of differentiated products, from which consumers of different preferences can select their favorite items. The standard model of product line design heavily relies on the distribution of consumers' willingness-to-pay, while such information can be rather inaccurate with estimation error and biased data. This thesis aims to address this problem through robust optimization and consists of three main chapters. In the first chapter we consider product line design in the case of the unknown probability of consumer types or with some prior knowledge of its bound. Based on a classic two-type model with a new set of less restrictive assumptions, we analyze properties of the optimal menu. We maximize a performance index to obtain the optimal robust solution, equivalent to the robustness criterion of minimax relative regret. For a popular parametrization of utility and cost functions, the optimal performance index is not smaller than 75% regardless of any possible consumer distribution with known type values. In the second chapter, we examine a product line model with an arbitrary number of consumer types and products in a generalized setting. Accounting for the uncertainty of both consumer types and their probabilities, our optimal robust product line has positive qualities across all products. It is remarkable that without knowing the exact number of consumer types the firm can achieve the optimal robust performance. We also study robust solutions under two other commonly used robustness criteria, including maximin payoff and minimax absolute regret. We demonstrate the effect of product variety on robust product lines and a menu-cost-adjusted performance index is proposed in order to decide how many products to provide robustly. As an alternative, data-driven distributionally robust optimization can be leveraged to determine a product line. Finally, in the third chapter, a novel optimization model is introduced for product line design given functions of utility, variable and fixed cost, and the number of products offered is endogenously determined. For robust pricing of some fixed products, we propose two methods to account for uncertainty of the willingness-to-pay distribution: one follows from a classic paradigm of robust optimization, and the other employs distributionally robust optimization with a Wasserstein distance characterizing data imprecision. For both methods, the optimization problems to offer the robust product lines are equivalent to mixed-integer linear programs.

  • Files
  • Details
  • Metrics
Type
doctoral thesis
DOI
10.5075/epfl-thesis-10974
Author(s)
Han, Jun  

EPFL

Advisors
Weber, T. A.  
Jury

Prof. Semyon Malamud (président) ; Prof. Thomas Alois Weber (directeur de thèse) ; Prof. Michel Bierlaire, Prof. Christiane Barz, Prof. Huseyin Topaloglu (rapporteurs)

Date Issued

2025

Publisher

EPFL

Publisher place

Lausanne

Public defense year

2025-03-06

Thesis number

10974

Total of pages

181

Subjects

product line design

•

robustness criterion

•

robust optimization

•

relative regret

•

distributionally robust optimization

•

robust pricing

•

second-degree price discrimination

•

Wasserstein distance

EPFL units
OES  
Faculty
CDM  
School
MTEI  
Doctoral School
EDMT  
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/247558
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés