Applying quantifier elimination to problems in simulation and optimization:
Abstract: "We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described in [Loos & Weispfenning] the practical applicability of the present method goes far beyond t...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
1996
|
| Schriftenreihe: | MIP / Universität Passau, Fakultät für Mathematik und Informatik
1996,07 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described in [Loos & Weispfenning] the practical applicability of the present method goes far beyond the more academic examples presented in [Loos & Weispfenning]. The optimization is achieved by various strategies to prune superfluous branches in the elimination tree constructed by the method. The main application concern the simulation of large networks of (electric, mechanical or hydraulic) components, whose characteristic curves are with piecewise linear in the variables to be eliminated. A typical goal in technical applications is to determine admissible ranges for certain variables from given ranges of other variables. By keeping certain characteristics of the components parametric, the elimination result can then be used to detect malfunction of certain components solely from the output behaviour of the network. The algorithms are currently used in a commercial software system for industrial applications. Moreover, we extend the elimination method for parametric linear programming in [Weispfenning 2] to the non-convex case by allowing arbitrary and-or combinations of parametric linear inequalities as constraints. We present a new strategy for finding smaller elimination sets and thus smaller elimination trees for parametric linear programming. Some benchmark examples from the NETLIB library of LP problems show the significance of this strategy even for convex linear programming problems." |
| Beschreibung: | 22, 4 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010769323 | ||
| 003 | DE-604 | ||
| 005 | 20140217 | ||
| 007 | t| | ||
| 008 | 960523s1996 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)36067058 | ||
| 035 | |a (DE-599)BVBBV010769323 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-154 |a DE-739 |a DE-12 |a DE-91G |a DE-384 |a DE-634 | ||
| 100 | 1 | |a Weispfenning, Volker |d 1944- |e Verfasser |0 (DE-588)108063550 |4 aut | |
| 245 | 1 | 0 | |a Applying quantifier elimination to problems in simulation and optimization |c V. Weispfenning |
| 264 | 1 | |a Passau |c 1996 | |
| 300 | |a 22, 4 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a MIP / Universität Passau, Fakultät für Mathematik und Informatik |v 1996,07 | |
| 520 | 3 | |a Abstract: "We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described in [Loos & Weispfenning] the practical applicability of the present method goes far beyond the more academic examples presented in [Loos & Weispfenning]. The optimization is achieved by various strategies to prune superfluous branches in the elimination tree constructed by the method. The main application concern the simulation of large networks of (electric, mechanical or hydraulic) components, whose characteristic curves are with piecewise linear in the variables to be eliminated. A typical goal in technical applications is to determine admissible ranges for certain variables from given ranges of other variables. By keeping certain characteristics of the components parametric, the elimination result can then be used to detect malfunction of certain components solely from the output behaviour of the network. The algorithms are currently used in a commercial software system for industrial applications. Moreover, we extend the elimination method for parametric linear programming in [Weispfenning 2] to the non-convex case by allowing arbitrary and-or combinations of parametric linear inequalities as constraints. We present a new strategy for finding smaller elimination sets and thus smaller elimination trees for parametric linear programming. Some benchmark examples from the NETLIB library of LP problems show the significance of this strategy even for convex linear programming problems." | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Elimination | |
| 650 | 4 | |a Linear programming | |
| 650 | 4 | |a Simulation methods | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Universität Passau, Fakultät für Mathematik und Informatik |t MIP |v 1996,07 |w (DE-604)BV000905393 |9 1996,07 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007191790 | |
Datensatz im Suchindex
| _version_ | 1820882317216841728 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Weispfenning, Volker 1944- |
| author_GND | (DE-588)108063550 |
| author_facet | Weispfenning, Volker 1944- |
| author_role | aut |
| author_sort | Weispfenning, Volker 1944- |
| author_variant | v w vw |
| building | Verbundindex |
| bvnumber | BV010769323 |
| classification_rvk | SS 5600 |
| ctrlnum | (OCoLC)36067058 (DE-599)BVBBV010769323 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010769323</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140217</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960523s1996 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36067058</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010769323</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-154</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Weispfenning, Volker</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108063550</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Applying quantifier elimination to problems in simulation and optimization</subfield><subfield code="c">V. Weispfenning</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22, 4 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">MIP / Universität Passau, Fakultät für Mathematik und Informatik</subfield><subfield code="v">1996,07</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described in [Loos & Weispfenning] the practical applicability of the present method goes far beyond the more academic examples presented in [Loos & Weispfenning]. The optimization is achieved by various strategies to prune superfluous branches in the elimination tree constructed by the method. The main application concern the simulation of large networks of (electric, mechanical or hydraulic) components, whose characteristic curves are with piecewise linear in the variables to be eliminated. A typical goal in technical applications is to determine admissible ranges for certain variables from given ranges of other variables. By keeping certain characteristics of the components parametric, the elimination result can then be used to detect malfunction of certain components solely from the output behaviour of the network. The algorithms are currently used in a commercial software system for industrial applications. Moreover, we extend the elimination method for parametric linear programming in [Weispfenning 2] to the non-convex case by allowing arbitrary and-or combinations of parametric linear inequalities as constraints. We present a new strategy for finding smaller elimination sets and thus smaller elimination trees for parametric linear programming. Some benchmark examples from the NETLIB library of LP problems show the significance of this strategy even for convex linear programming problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Elimination</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulation methods</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität Passau, Fakultät für Mathematik und Informatik</subfield><subfield code="t">MIP</subfield><subfield code="v">1996,07</subfield><subfield code="w">(DE-604)BV000905393</subfield><subfield code="9">1996,07</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007191790</subfield></datafield></record></collection> |
| id | DE-604.BV010769323 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T17:04:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007191790 |
| oclc_num | 36067058 |
| open_access_boolean | |
| owner | DE-154 DE-739 DE-12 DE-91G DE-BY-TUM DE-384 DE-634 |
| owner_facet | DE-154 DE-739 DE-12 DE-91G DE-BY-TUM DE-384 DE-634 |
| physical | 22, 4 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | MIP / Universität Passau, Fakultät für Mathematik und Informatik |
| spelling | Weispfenning, Volker 1944- Verfasser (DE-588)108063550 aut Applying quantifier elimination to problems in simulation and optimization V. Weispfenning Passau 1996 22, 4 S. txt rdacontent n rdamedia nc rdacarrier MIP / Universität Passau, Fakultät für Mathematik und Informatik 1996,07 Abstract: "We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described in [Loos & Weispfenning] the practical applicability of the present method goes far beyond the more academic examples presented in [Loos & Weispfenning]. The optimization is achieved by various strategies to prune superfluous branches in the elimination tree constructed by the method. The main application concern the simulation of large networks of (electric, mechanical or hydraulic) components, whose characteristic curves are with piecewise linear in the variables to be eliminated. A typical goal in technical applications is to determine admissible ranges for certain variables from given ranges of other variables. By keeping certain characteristics of the components parametric, the elimination result can then be used to detect malfunction of certain components solely from the output behaviour of the network. The algorithms are currently used in a commercial software system for industrial applications. Moreover, we extend the elimination method for parametric linear programming in [Weispfenning 2] to the non-convex case by allowing arbitrary and-or combinations of parametric linear inequalities as constraints. We present a new strategy for finding smaller elimination sets and thus smaller elimination trees for parametric linear programming. Some benchmark examples from the NETLIB library of LP problems show the significance of this strategy even for convex linear programming problems." Algebra, Boolean Elimination Linear programming Simulation methods Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s Informatik (DE-588)4026894-9 s Mathematik (DE-588)4037944-9 s DE-604 Universität Passau, Fakultät für Mathematik und Informatik MIP 1996,07 (DE-604)BV000905393 1996,07 |
| spellingShingle | Weispfenning, Volker 1944- Applying quantifier elimination to problems in simulation and optimization Algebra, Boolean Elimination Linear programming Simulation methods Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)4037944-9 |
| title | Applying quantifier elimination to problems in simulation and optimization |
| title_auth | Applying quantifier elimination to problems in simulation and optimization |
| title_exact_search | Applying quantifier elimination to problems in simulation and optimization |
| title_full | Applying quantifier elimination to problems in simulation and optimization V. Weispfenning |
| title_fullStr | Applying quantifier elimination to problems in simulation and optimization V. Weispfenning |
| title_full_unstemmed | Applying quantifier elimination to problems in simulation and optimization V. Weispfenning |
| title_short | Applying quantifier elimination to problems in simulation and optimization |
| title_sort | applying quantifier elimination to problems in simulation and optimization |
| topic | Algebra, Boolean Elimination Linear programming Simulation methods Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd Mathematik (DE-588)4037944-9 gnd |
| topic_facet | Algebra, Boolean Elimination Linear programming Simulation methods Theoretische Informatik Informatik Mathematik |
| volume_link | (DE-604)BV000905393 |
| work_keys_str_mv | AT weispfenningvolker applyingquantifiereliminationtoproblemsinsimulationandoptimization |