Publikation: Solving Mixed-Integer Programming Problems Using Piecewise Linearization Methods
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We present an overview on piecewise linearization methods for MINLPs. This will include the concept of disjunctive constraints, which is necessary to define logarith- mic reformulations of the so called disaggregated convex combination method and the convex combination method. For the case of a general univariate quadratic func- tion we also calculate the linearization error and proof that equidistant grid points minimize this error. For a bivariate product of two variables we do the same error analysis for the case of J 1 -triangulations and again equidistant grid points will be optimal. The presented methods will then be applied to a newly developed model for a hybrid energy supply network problem. We show that linearizations are able to solve this non-convex optimization problem within reasonable time.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BERNREUTHER, Marco, 2017. Solving Mixed-Integer Programming Problems Using Piecewise Linearization Methods [Bachelor thesis]. Konstanz: Universität KonstanzBibTex
@mastersthesis{Bernreuther2017Solvi-40493, year={2017}, title={Solving Mixed-Integer Programming Problems Using Piecewise Linearization Methods}, address={Konstanz}, school={Universität Konstanz}, author={Bernreuther, Marco} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40493"> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-07T07:22:55Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:abstract xml:lang="eng">We present an overview on piecewise linearization methods for MINLPs. This will include the concept of disjunctive constraints, which is necessary to define logarith- mic reformulations of the so called disaggregated convex combination method and the convex combination method. For the case of a general univariate quadratic func- tion we also calculate the linearization error and proof that equidistant grid points minimize this error. For a bivariate product of two variables we do the same error analysis for the case of J 1 -triangulations and again equidistant grid points will be optimal. The presented methods will then be applied to a newly developed model for a hybrid energy supply network problem. We show that linearizations are able to solve this non-convex optimization problem within reasonable time.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40493/3/Bernreuther_2-1gxw6ja5feelr3.pdf"/> <dc:contributor>Bernreuther, Marco</dc:contributor> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/40493/3/Bernreuther_2-1gxw6ja5feelr3.pdf"/> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-11-07T07:22:55Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40493"/> <dcterms:issued>2017</dcterms:issued> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/> <dc:creator>Bernreuther, Marco</dc:creator> <dcterms:title>Solving Mixed-Integer Programming Problems Using Piecewise Linearization Methods</dcterms:title> </rdf:Description> </rdf:RDF>