• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Quantitative Measures of Solution Robustness in a Parametrized Multicriteria Zero-One Linear Programming Problem

Yury Nikulin, Marko M. Mäkelä, Quantitative Measures of Solution Robustness in a Parametrized Multicriteria Zero-One Linear Programming Problem. TUCS Technical Reports 917, Turku Centre for Computer Science, 2008.

Abstract:

A multicriteria boolean programming problem with linear cost functions in which initial coefficients of the cost functions are subject to perturbations is considered. For any optimal alternative, with respect to parameterized principle of optimality ”from Condorcet to Pareto”, appropriate measures of the quality are introduced. These measures correspond to the so-called stability and accuracy functions defined
earlier for optimal solutions of a generic multicriteria combinatorial optimization problem with Pareto and lexicographic optimality principles. Various properties of such functions are studied and maximum norms of perturbations for which an optimal alternative preserves its optimality are calculated. To illustrate the way how the stability and accuracy functions can be used as efficient tools for
post-optimal analysis, an application from the voting theory is considered.

Files:

Full publication in PDF-format

BibTeX entry:

@TECHREPORT{tNiMa08a,
  title = {Quantitative Measures of Solution Robustness in a Parametrized Multicriteria Zero-One Linear Programming Problem},
  author = {Nikulin, Yury and Mäkelä, Marko M.},
  number = {917},
  series = {TUCS Technical Reports},
  publisher = {Turku Centre for Computer Science},
  year = {2008},
  ISBN = {978-952-12-2198-9},
}

Belongs to TUCS Research Unit(s): Other

Edit publication