| dc.contributor.advisor | Grygarová, Libuše | |
| dc.creator | Vranka, Miroslav | |
| dc.date.accessioned | 2017-03-17T11:51:45Z | |
| dc.date.available | 2017-03-17T11:51:45Z | |
| dc.date.issued | 2006 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11956/3318 | |
| dc.description.abstract | Interval linear programming means miner x, M for c E c, where M == {X E IRn; Ax == b, X > O, A E A, b E b }, A C ]Rmxn, b C JRm, c C IRn, A, b, c are intervals. The first part of the master thesis introduce a new approach to interval linear programming, defining always bounded set of feasible solutions of a linear programming problem and studying its properties. The main result of this part demonstrates that the modified set of feasible solutions varies "continuously" with the entries in the matrix A and in the vector b. The second part studies the solution function continuity for an interval linear programming problem. Powered by TCPDF (www.tcpdf.org) | en_US |
| dc.language | English | cs_CZ |
| dc.language.iso | en_US | |
| dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
| dc.title | Interval linear programming | en_US |
| dc.type | diplomová práce | cs_CZ |
| dcterms.created | 2006 | |
| dcterms.dateAccepted | 2006-02-13 | |
| dc.description.department | Department of Applied Mathematics | en_US |
| dc.description.department | Katedra aplikované matematiky | cs_CZ |
| dc.description.faculty | Faculty of Mathematics and Physics | en_US |
| dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
| dc.identifier.repId | 44486 | |
| dc.title.translated | Intervalové lineární programování | cs_CZ |
| dc.contributor.referee | Zimmermann, Karel | |
| dc.identifier.aleph | 000841152 | |
| thesis.degree.name | Mgr. | |
| thesis.degree.level | magisterské | cs_CZ |
| thesis.degree.discipline | Discrete Mathematics and Optimization | en_US |
| thesis.degree.discipline | Diskrétní matematika a optimalizace | cs_CZ |
| thesis.degree.program | Informatics | en_US |
| thesis.degree.program | Informatika | cs_CZ |
| uk.thesis.type | diplomová práce | cs_CZ |
| uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra aplikované matematiky | cs_CZ |
| uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Applied Mathematics | en_US |
| uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
| uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
| uk.faculty-abbr.cs | MFF | cs_CZ |
| uk.degree-discipline.cs | Diskrétní matematika a optimalizace | cs_CZ |
| uk.degree-discipline.en | Discrete Mathematics and Optimization | en_US |
| uk.degree-program.cs | Informatika | cs_CZ |
| uk.degree-program.en | Informatics | en_US |
| thesis.grade.cs | Výborně | cs_CZ |
| thesis.grade.en | Excellent | en_US |
| uk.abstract.en | Interval linear programming means miner x, M for c E c, where M == {X E IRn; Ax == b, X > O, A E A, b E b }, A C ]Rmxn, b C JRm, c C IRn, A, b, c are intervals. The first part of the master thesis introduce a new approach to interval linear programming, defining always bounded set of feasible solutions of a linear programming problem and studying its properties. The main result of this part demonstrates that the modified set of feasible solutions varies "continuously" with the entries in the matrix A and in the vector b. The second part studies the solution function continuity for an interval linear programming problem. Powered by TCPDF (www.tcpdf.org) | en_US |
| uk.file-availability | V | |
| uk.publication.place | Praha | cs_CZ |
| uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra aplikované matematiky | cs_CZ |
| dc.identifier.lisID | 990008411520106986 | |
