Maximal and minimal solutions for two-sided problem of type (1,n) in max-min algebra
The result's identifiers
Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Maximal and minimal solutions for two-sided problem of type (1,n) in max-min algebra
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2009
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
IMEA 2009
ISBN
978-80-7041-851-2
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
Gaudeamus
Place of publication
Hradec Králové
Event location
Hradec Králové
Event date
May 28, 2009
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—