# Efficient computation of solution space and conflicts detection for linear systems

1 STEEP - Sustainability transition, environment, economy and local policy
Inria Grenoble - Rhône-Alpes, LJK - Laboratoire Jean Kuntzmann
Abstract : We analyze a system of linear inequations $l \leq A\cdot x \leq u$, used for the purpose of Material Flow Analysis, with three different but complementary goals: (i) given some known variables $x_i$, efficiently compute the solution space of unknown variables, (ii) if the set of constraints is infeasible, efficiently identify the conflicts, (iii) efficiently classify variables to determine whereas they are redundant, just measured, determinable or non-determinable. In each case we compare the efficiency of different algorithms or languages.
Document type :
Master thesis

Cited literature [3 references]

https://hal.inria.fr/hal-02433237
Contributor : Peter Sturm Connect in order to contact the contributor
Submitted on : Thursday, January 9, 2020 - 8:48:16 AM
Last modification on : Wednesday, November 3, 2021 - 5:13:48 AM

### Identifiers

• HAL Id : hal-02433237, version 1

### Citation

Alexandre Borthomieu. Efficient computation of solution space and conflicts detection for linear systems. Modeling and Simulation. 2019. ⟨hal-02433237⟩

Record views