Debugging Tool for MILP and MIQCP formulations: obtaining constraints responsible for infeasible or unbounded pyomo models using Gurobi solver.
| dc.contributor.author | Roth, Maximilian | |
| dc.date.accessioned | 2022-05-10T14:22:18Z | |
| dc.date.available | 2022-05-10T14:22:18Z | |
| dc.date.created | 2022-05 | |
| dc.date.issued | 2022-05-10 | |
| dc.description | Optimization problems, in this case written in Pyomo, with modeling errors can lead to infeasibility of the model. From the perspective of the modeler, it is therefore essential to know which constraints lead to the infeasibility of the problem or which constraints are contradictory and which constraints have to be adjusted to make the model feasible. In this case, the IIS (Irreducible Inconsistent Subsystem) function of Gurobi is used as a basis, the interface to Pyomo is implemented and a structured output file is created. | de_DE |
| dc.identifier.uri | https://tudatalib.ulb.tu-darmstadt.de/handle/tudatalib/3460 | |
| dc.identifier.uri | https://doi.org/10.48328/tudatalib-872 | |
| dc.language.iso | en | de_DE |
| dc.rights.license | ODC-BY-1.0 (https://opendatacommons.org/licenses/by/1.0/) | |
| dc.subject | MILP | de_DE |
| dc.subject | MIQCP | de_DE |
| dc.subject | Debugging | de_DE |
| dc.subject | Pyomo | de_DE |
| dc.subject | Python | de_DE |
| dc.subject.classification | 4.43-02 | |
| dc.subject.ddc | 004 | |
| dc.title | Debugging Tool for MILP and MIQCP formulations: obtaining constraints responsible for infeasible or unbounded pyomo models using Gurobi solver. | de_DE |
| dc.type | Software | de_DE |
| dcterms.accessRights | openAccess | |
| person.identifier.orcid | 0000-0003-1353-9446 | |
| tuda.history.classification | Version=2020-2024;409-02 Softwaretechnik und Programmiersprachen | |
| tuda.unit | TUDa |
Files
Original bundle
1 - 1 of 1
| Name | Description | Size | Format | |
|---|---|---|---|---|
| debug.py | 5.48 KB |