Tolerance types of interval eigenvectors in max-plus algebra

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F16%3A50005048" target="_blank" >RIV/62690094:18450/16:50005048 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ins.2016.05.023" target="_blank" >http://dx.doi.org/10.1016/j.ins.2016.05.023</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2016.05.023" target="_blank" >10.1016/j.ins.2016.05.023</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Tolerance types of interval eigenvectors in max-plus algebra

Popis výsledku v původním jazyce

Max-plus algebra plays a key role in the study of discrete event systems in connection with optimization problems such as scheduling or project management in which the objective function depends on the operations maximum and plus. The steady states of such systems correspond to the eigenvectors of max-plus matrices, therefore the investigation of the properties of these eigenvectors is important for applications. Three recognition problems connected with the interval eigenproblem in max-plus algebras have been solved. Polynomial algorithms have been described for recognizing the strong tolerability and the tolerability of an interval eigenvector with respect to an interval matrix. Recognizing weak tolerability has been reduced to solving a set of polynomially many instances of an LP minimization problem.

Název v anglickém jazyce

Tolerance types of interval eigenvectors in max-plus algebra

Popis výsledku anglicky

Max-plus algebra plays a key role in the study of discrete event systems in connection with optimization problems such as scheduling or project management in which the objective function depends on the operations maximum and plus. The steady states of such systems correspond to the eigenvectors of max-plus matrices, therefore the investigation of the properties of these eigenvectors is important for applications. Three recognition problems connected with the interval eigenproblem in max-plus algebras have been solved. Polynomial algorithms have been described for recognizing the strong tolerability and the tolerability of an interval eigenvector with respect to an interval matrix. Recognizing weak tolerability has been reduced to solving a set of polynomially many instances of an LP minimization problem.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

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 periodika

Information sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

367

Číslo periodika v rámci svazku

November

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

14-27

Kód UT WoS článku

000382794400002

EID výsledku v databázi Scopus

—