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”

On relation of possibly efficiency and robust counterparts in interval multiobjective linear programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10365256" target="_blank" >RIV/00216208:11320/17:10365256 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-67308-0_34" target="_blank" >http://dx.doi.org/10.1007/978-3-319-67308-0_34</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-67308-0_34" target="_blank" >10.1007/978-3-319-67308-0_34</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On relation of possibly efficiency and robust counterparts in interval multiobjective linear programming

  • Original language description

    We investigate multiobjective linear programming with uncertain cost coefficients. We assume that lower and upper bounds for uncertain values are known, no other assumption on uncertain costs is needed. We focus on the so called possibly efficiency, which is defined as efficiency of at least one realization of interval coefficients. We show many favourable properties including existence, low computational performance of determining possibly efficient solutions, convexity of the dominance cone or connectedness or the efficiency set. In the second part, we discuss robust optimization approach for dealing with uncertain costs. We show that the corresponding robust counterpart is closely related to possible efficiency.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    50201 - Economic Theory

Result continuities

  • Project

    <a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>

  • Continuities

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

Others

  • Publication year

    2017

  • 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

  • Article name in the collection

    Optimization and Decision Science: Methodologies and Applications: ODS, Sorrento, Italy, September 4-7, 2017

  • ISBN

    978-3-319-67308-0

  • ISSN

    2194-1017

  • e-ISSN

    neuvedeno

  • Number of pages

    9

  • Pages from-to

    335-343

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Sorrento, Italy

  • Event date

    Sep 4, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article