Redundancy in interval linear systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10419315" target="_blank" >RIV/00216208:11320/20:10419315 - isvavai.cz</a>

Výsledek na webu

<a href="https://mme2020.mendelu.cz/wcd/w-rek-mme/mme2020_conference_proceedings_final_final.pdf" target="_blank" >https://mme2020.mendelu.cz/wcd/w-rek-mme/mme2020_conference_proceedings_final_final.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Redundancy in interval linear systems

Popis výsledku v původním jazyce

In a system of linear equations and inequalities, one constraint is redundant if it can be dropped from the system without affecting the solution set. Redundancy can be effectively checked by linear programming. However, if the coefficients are uncertain, the problem becomes more cumbersome. In this paper, we assume that the coefficients come from some given compact intervals and no other information is given. We discuss two concepts of redundancy in this interval case, the weak and the strong redundancy. This former refers to redundancy for at least one realization of interval coefficients, while the latter means redundancy for every realization. We characterize both kinds of redundancies for various types of linear systems; in some cases the problem is polynomial, but certain cases are computationally intractable. As an open problem, we leave weak redundancy of equations. Herein, a characterization is known only for certain special cases, but for a general case a complete characterization is still unknown.

Název v anglickém jazyce

Redundancy in interval linear systems

Popis výsledku anglicky

In a system of linear equations and inequalities, one constraint is redundant if it can be dropped from the system without affecting the solution set. Redundancy can be effectively checked by linear programming. However, if the coefficients are uncertain, the problem becomes more cumbersome. In this paper, we assume that the coefficients come from some given compact intervals and no other information is given. We discuss two concepts of redundancy in this interval case, the weak and the strong redundancy. This former refers to redundancy for at least one realization of interval coefficients, while the latter means redundancy for every realization. We characterize both kinds of redundancies for various types of linear systems; in some cases the problem is polynomial, but certain cases are computationally intractable. As an open problem, we leave weak redundancy of equations. Herein, a characterization is known only for certain special cases, but for a general case a complete characterization is still unknown.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50201 - Economic Theory

Projekt

<a href="/cs/project/GA18-04735S" target="_blank" >GA18-04735S: Nové přístupy pro relaxační a aproximační techniky v deterministické globální optimalizaci</a><br>

Návaznosti

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

Rok uplatnění

2020

Kód důvěrnosti údajů

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

Název statě ve sborníku

38th International Conference on Mathematical Methods in Economics 2020 (MME 2020). Conference Proceedings

ISBN

978-80-7509-734-7

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

160-165

Název nakladatele

Mendel University in Brno

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

9. 9. 2020

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—