Efficient computation of solution space and conflicts detection for linear systems - Archive ouverte HAL Access content directly
Master Thesis Year : 2019

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

(1)
1
Alexandre Borthomieu

#### 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.

#### Domains

Computer Science [cs] Modeling and Simulation
Loading...

### Dates and versions

hal-02433237 , version 1 (09-01-2020)

### Identifiers

• HAL Id : hal-02433237 , version 1

### Cite

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

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

43 View
74 Download

### Share

Gmail Facebook Twitter LinkedIn More