Maximal and minimal solutions for two-sided problem of type (1,n) in max-min algebra

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F09%3A00002630" target="_blank" >RIV/62690094:18450/09:00002630 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Maximal and minimal solutions for two-sided problem of type (1,n) in max-min algebra
Popis výsledku v původním jazyce
Basic characteristics and the solvability of linear systems in max-min algebra are presented. It is shown how to compute maximal and minimal solutions for two-sided problem A x = B x for matrices of type (1, n). The basic problem for matrices of type (1,n) is extended by adding an upper bound and a lower bound for the solution. Concrete examples are provided for better understanding of computation principles in max-min algebra. Reader can try the presented algorithms on the web site. Algorithms are implemented in programming language Java and are offered as an open library.
Název v anglickém jazyce
Maximal and minimal solutions for two-sided problem of type (1,n) in max-min algebra
Popis výsledku anglicky
Basic characteristics and the solvability of linear systems in max-min algebra are presented. It is shown how to compute maximal and minimal solutions for two-sided problem A x = B x for matrices of type (1, n). The basic problem for matrices of type (1,n) is extended by adding an upper bound and a lower bound for the solution. Concrete examples are provided for better understanding of computation principles in max-min algebra. Reader can try the presented algorithms on the web site. Algorithms are implemented in programming language Java and are offered as an open library.

Rok uplatnění
2009
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ů

Podobné výsledky(10)