Abstract
We consider a system A {ring operator} x ≥ b, where A ∈ R+m × n is a non-negative matrix and b ∈ R+m is a non-negative vector over the n-dimensional variable l ≤ x ≤ u, where l, u ∈ R+n are lower and upper bounds, respectively, and {ring operator} is either a max-min or a max-product composition. It is shown that the set of minimal solutions of such systems can be computed in incremental quasi-polynomial time.
Original language | British English |
---|---|
Pages (from-to) | 2272-2277 |
Number of pages | 6 |
Journal | Fuzzy Sets and Systems |
Volume | 159 |
Issue number | 17 |
DOIs | |
State | Published - 1 Sep 2008 |
Keywords
- Enumeration algorithms
- Finding all minimal solutions
- Minimal hitting sets
- Systems with fuzzy relation equation constraints