Resolving infeasibility in extremal algebras

DOI10.1016/S0024-3795(98)10248-3zbMath0932.15009OpenAlexW2035068695MaRDI QIDQ1300912

Pavel Diko, Katarína Cechlárova

Publication date: 13 March 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(98)10248-3

zbMATH Keywords

NP-completenesssystems of linear equationsextremal algebrasmaxgroup algebramaxmin algebrarelieving set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic systems of matrices (15A30) Linear equations (linear algebraic aspects) (15A06)

Related Items (8)

Iteration algorithm for solving \(Ax = b\) in max--min algebra ⋮ Interval systems of max-separable linear equations ⋮ A note on unsolvable systems of max-min (fuzzy) equations ⋮ Contributions to max-min convex geometry. I: Segments ⋮ Control solvability of interval systems of max-separable linear equations ⋮ Interval systems of max-separable linear equations ⋮ A note on resolving the inconsistency of one-sided max-plus linear equations ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Residuation in fuzzy algebra and some applications
• A note on resolving infeasibility in linear programs by constraint relaxation

This page was built for publication: Resolving infeasibility in extremal algebras