Please use this identifier to cite or link to this item:
http://hdl.handle.net/2445/188704
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Romano Rodríguez, Susana | - |
dc.contributor.author | Baradat Marı́, Josep | - |
dc.date.accessioned | 2022-09-05T09:45:43Z | - |
dc.date.available | 2022-09-05T09:45:43Z | - |
dc.date.issued | 2022-06-13 | - |
dc.identifier.uri | http://hdl.handle.net/2445/188704 | - |
dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Susana Romano Rodríguez | ca |
dc.description.abstract | [en] The following article presents the necessary knowledge to understand and solve linear programming problems. Linear programming was born in 1947, when G.B. Dantzig suggested the simplex method in order to solve planification problems of the United States Air Forces. In this article it is explained how this method works and a series of examples are solved by using a program which has the method’s algorithm implemented. To do this, the definitions and basic concepts of linear programming are explained to understand the linear programming problems from an algebraic point of view. There are also explanations of the necessary concepts and definitions of convex analysis to understand this type of problems from a geometric point of view. On the other hand, the concept of duality and the relation between primal linear programming problems and dual linear programming problems are explained. Finally, this article presents the transportation problem, a linear programming practical case, and the algorithm in order to solve it. This algorithm has been implemented in a program and has been used to solve an example shown in this article. | ca |
dc.format.extent | 62 p. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | cat | ca |
dc.rights | cc-by-nc-nd (c) Josep Baradat Marı́, 2022 | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
dc.subject.classification | Programació lineal | ca |
dc.subject.classification | Treballs de fi de grau | - |
dc.subject.classification | Programació (Matemàtica) | ca |
dc.subject.classification | Algorismes computacionals | ca |
dc.subject.classification | Optimització matemàtica | ca |
dc.subject.other | Linear programming | en |
dc.subject.other | Bachelor's theses | - |
dc.subject.other | Mathematical programming | en |
dc.subject.other | Computer algorithms | en |
dc.subject.other | Mathematical optimization | en |
dc.title | Introducció a la programació lineal: mètode sı́mplex i el problema del transport | ca |
dc.type | info:eu-repo/semantics/bachelorThesis | ca |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
Appears in Collections: | Programari - Treballs de l'alumnat Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
codi font.zip | Codi font | 15.02 kB | zip | View/Open |
tfg_baradat_mari_josep.pdf | Memòria | 2.02 MB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License