Sisäpistemenetelmät lineaarisessa optimoinnissa

Sisäpistemenetelmät ovat menetelmäluokka optimointiongelmien ratkaisemiseen. Tässä tutkielmassa keskitytään sisäpistemenetelmiin lineaarisessa optimoinnissa ja käydään läpi tiettyjen menetelmien idea. Käytetyin sisäpistemenetelmä on ei-sallittu primaali-duaalimenetelmä, joka voidaan toteuttaa erittä...

Full description

Bibliographic Details
Main Author: Lohi, Jonni
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2018
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/58195
_version_ 1826225799607353344
author Lohi, Jonni
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Lohi, Jonni Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Lohi, Jonni Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Lohi, Jonni
datasource_str_mv jyx
description Sisäpistemenetelmät ovat menetelmäluokka optimointiongelmien ratkaisemiseen. Tässä tutkielmassa keskitytään sisäpistemenetelmiin lineaarisessa optimoinnissa ja käydään läpi tiettyjen menetelmien idea. Käytetyin sisäpistemenetelmä on ei-sallittu primaali-duaalimenetelmä, joka voidaan toteuttaa erittäin tehokkaasti. Sisäpistemenetelmien lisäksi lineaarinen optimointiongelma voidaan ratkaista Simplex-menetelmällä, ja molemmat tavat ovat laajalti käytössä. Myös sisäpistemenetelmien tehokas toteutus ja niiden hyvät ja huonot puolet Simplex-menetelmään verrattuna ovat tutkielmassa käsiteltäviä aiheita. Interior point methods are a class of methods for solving optimization problems. In this thesis we focus on interior point methods in linear programming and go through the ideas of certain methods. The most used interior point method is an infeasible primal-dual method, which can be implemented very efficiently. In addition to interior point methods, linear programs can be solved by the Simplex method, and both ways are widely used. Ef- ficient implementation of interior point methods and their pros and cons in comparison with the Simplex method are also topics covered in the thesis.
first_indexed 2019-08-19T08:21:21Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.author", "value": "Lohi, Jonni", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2018-05-29T08:23:40Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2018-05-29T08:23:40Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2018", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/58195", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Sis\u00e4pistemenetelm\u00e4t ovat menetelm\u00e4luokka optimointiongelmien ratkaisemiseen.\nT\u00e4ss\u00e4 tutkielmassa keskityt\u00e4\u00e4n sis\u00e4pistemenetelmiin lineaarisessa optimoinnissa ja k\u00e4yd\u00e4\u00e4n\nl\u00e4pi tiettyjen menetelmien idea. K\u00e4ytetyin sis\u00e4pistemenetelm\u00e4 on ei-sallittu primaali-duaalimenetelm\u00e4, joka voidaan toteuttaa eritt\u00e4in tehokkaasti. Sis\u00e4pistemenetelmien lis\u00e4ksi\nlineaarinen optimointiongelma voidaan ratkaista Simplex-menetelm\u00e4ll\u00e4, ja molemmat tavat\novat laajalti k\u00e4yt\u00f6ss\u00e4. My\u00f6s sis\u00e4pistemenetelmien tehokas toteutus ja niiden hyv\u00e4t ja huonot puolet Simplex-menetelm\u00e4\u00e4n verrattuna ovat tutkielmassa k\u00e4sitelt\u00e4vi\u00e4 aiheita.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Interior point methods are a class of methods for solving optimization problems. In this thesis we focus on interior point methods in linear programming and go through the\nideas of certain methods. The most used interior point method is an infeasible primal-dual\nmethod, which can be implemented very efficiently. In addition to interior point methods,\nlinear programs can be solved by the Simplex method, and both ways are widely used. Ef-\nficient implementation of interior point methods and their pros and cons in comparison with\nthe Simplex method are also topics covered in the thesis.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Miia Hakanen (mihakane@jyu.fi) on 2018-05-29T08:23:40Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2018-05-29T08:23:40Z (GMT). No. of bitstreams: 0\n Previous issue date: 2018", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "24", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "lineaarinen optimointi", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "sis\u00e4pistemenetelm\u00e4t", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Sis\u00e4pistemenetelm\u00e4t lineaarisessa optimoinnissa", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-201805292867", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_58195
language fin
last_indexed 2025-02-18T10:54:53Z
main_date 2018-01-01T00:00:00Z
main_date_str 2018
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/d83919c4-356f-42c8-bfcd-d1345c744493\/download","text":"URN:NBN:fi:jyu-201805292867.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2018
record_format qdc
source_str_mv jyx
spellingShingle Lohi, Jonni Sisäpistemenetelmät lineaarisessa optimoinnissa lineaarinen optimointi sisäpistemenetelmät Tietotekniikka Mathematical Information Technology 602
title Sisäpistemenetelmät lineaarisessa optimoinnissa
title_full Sisäpistemenetelmät lineaarisessa optimoinnissa
title_fullStr Sisäpistemenetelmät lineaarisessa optimoinnissa Sisäpistemenetelmät lineaarisessa optimoinnissa
title_full_unstemmed Sisäpistemenetelmät lineaarisessa optimoinnissa Sisäpistemenetelmät lineaarisessa optimoinnissa
title_short Sisäpistemenetelmät lineaarisessa optimoinnissa
title_sort sisäpistemenetelmät lineaarisessa optimoinnissa
title_txtP Sisäpistemenetelmät lineaarisessa optimoinnissa
topic lineaarinen optimointi sisäpistemenetelmät Tietotekniikka Mathematical Information Technology 602
topic_facet 602 Mathematical Information Technology Tietotekniikka lineaarinen optimointi sisäpistemenetelmät
url https://jyx.jyu.fi/handle/123456789/58195 http://www.urn.fi/URN:NBN:fi:jyu-201805292867
work_keys_str_mv AT lohijonni sisäpistemenetelmätlineaarisessaoptimoinnissa