All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Global sensitivity analysis and robustness in linear programming using different norms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10509906" target="_blank" >RIV/00216208:11320/25:10509906 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=l0fOmehkWZ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=l0fOmehkWZ</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10100-025-00960-5" target="_blank" >10.1007/s10100-025-00960-5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Global sensitivity analysis and robustness in linear programming using different norms

  • Original language description

    Sensitivity analysis in linear programming is a standard technique for measuring the effects of variations in one coefficient on the optimal value and optimal solution. However, one-coefficient variations are too simple to reflect the complexity of real-life situations. That is why we propose a more general approach and consider variations of possibly all input data. The goal is to determine the maximum variations of the data in a given norm such that the computed optimal basis remains optimal. We present general results valid for an arbitrary norm, and then we focus particularly on the spectral norm and the maximum norm. Further, we analyse computational complexity of the problem, and for the computationally hard cases we derive efficiently computable lower and upper bounds. Besides the basic case, in which we allow variations of all input coefficients, we also consider variations of certain submatrices or along a certain pattern. Eventually, we present results of numerical experiments, where we analysed and compared computation time and accuracy of the proposed approximations on a collection of dataset.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA25-15714S" target="_blank" >GA25-15714S: Advanced theory of robustness in operations research and optimization models</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Central European Journal of Operations Research

  • ISSN

    1435-246X

  • e-ISSN

    1613-9178

  • Volume of the periodical

    33

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    17

  • Pages from-to

    661-677

  • UT code for WoS article

    001410547700001

  • EID of the result in the Scopus database

    2-s2.0-85217436497