Back to search

Clemson University

The Robustness Gap for Uncertain Multiobjective Linear Programs

Abstract

dc:description.abstract

In robust multiobjective optimization, a new robustness gap is defined in [4]. This gap measures the minimal distance between the robust Pareto set and the Pareto sets of all scenarios. Upper and lower bounds of this gap are derived for the convex case. In this thesis, a deeper examination into the definition and application of this gap for uncertain multiobjective linear programs is presented. Numerical examples are developed and results are reported for the first time.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Mathematical and Statistical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Fritzen, Lena
Contributors dc:contributor
  • Margaret Wiecek
  • Matthew Saltzman
  • Yuyuan Ouyang

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/3411

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Fritzen, Lena. The Robustness Gap for Uncertain Multiobjective Linear Programs. Thesis thesis, https://open.clemson.edu/all_theses/3411